#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
void solveMethod(string line, int k)
{
if(line.size() == 0)
{
cout << -1 << endl;
return;
}
int a[26] = {0};
char cur = line[0];
int count = 1;
a[cur - 'A'] = 1;
for(int i = 1; i < line.size(); i++)
{
char c = line[i];
if(cur == c)
{
count++;
}
else
{
cur = c;
count = 1;
}
a[cur - 'A'] = (a[cur - 'A'] > 0) ? (a[cur - 'A'] > count? a[cur - 'A'] : count) : count;
}
vector<int> list;
for(int i = 0; i < 26; i++)
{
if(a[i] > 0)
{
list.push_back(a[i]);
}
}
sort(list.begin(), list.end(), [](int a1, int a2)
{
return a1 > a2;
});
if(k > list.size())
{
cout << -1 << endl;
}
else
{
cout << list[k - 1] << endl;
}
}
int main()
{
string line;
int k;
cin >> line >> k;
solveMethod(line, k);
return 0;
}