#include <bits/stdc++.h>
using namespace std;
int n, m;
char s[2010], t[2010];
int bd[2010];
int hs[2010][2], ht[2010][2];
const int M = 137, mod1 = 998244353, mod2 = 1000000007;
int pw1[2010], pw2[2010];
inline bool Check(int u, int v, int len)
{
	return 1ll * (hs[u + len - 1][0] - hs[u - 1][0] + mod1) * pw1[v] % mod1 == 1ll * (ht[v + len - 1][0] - ht[v - 1][0] + mod1) * pw1[u] % mod1
	    && 1ll * (hs[u + len - 1][1] - hs[u - 1][1] + mod2) * pw2[v] % mod2 == 1ll * (ht[v + len - 1][1] - ht[v - 1][1] + mod2) * pw2[u] % mod2;
}
inline int LCP(int u, int v)
{
	int L = 0, R = min(n - u + 1, m - v + 1);
	while(L < R)
	{
		int mid = (L + R + 1) >> 1;
		if(Check(u, v, mid))
			L = mid;
		else
			R = mid - 1;
	}
	return L; 
}
int main()
{
	pw1[0] = pw2[0] = 1;
	for(int i = 1; i <= 2000; i++)
	{
		pw1[i] = 1ll * pw1[i - 1] * M % mod1;
		pw2[i] = 1ll * pw2[i - 1] * M % mod2;
	}
	scanf("%s", s + 1);
	n = strlen(s + 1);
	for(int i = 1; i <= n; i++)
	{
		ht[i][0] = hs[i][0] = (hs[i - 1][0] + 1ll * s[i] * pw1[i]) % mod1;
		ht[i][1] = hs[i][1] = (hs[i - 1][1] + 1ll * s[i] * pw2[i]) % mod2;
	}
	for(int i = 1; i <= n; i++)
		for(int j = 1; j < i; j++)
			if(Check(1, i - j + 1, j))
				bd[i] = j;
	scanf("%d", &m);
	int ans = 0;
	for(int i = 1; i <= n; i++)
	{
		int tmp = (m - bd[i]) / (i - bd[i]), r = tmp * (i - bd[i]) + bd[i];
		for(int j = 1; j <= r; j++)
			t[j] = s[(j - 1) % (i - bd[i]) + 1];
		for(int j = r + 1; j <= m; j++)
			t[j] = s[1];
		for(int i = 1; i <= m; i++)
		{
			ht[i][0] = (ht[i - 1][0] + 1ll * t[i] * pw1[i]) % mod1;
			ht[i][1] = (ht[i - 1][1] + 1ll * t[i] * pw2[i]) % mod2;
		}
		int tot = 0;
		for(int i = 1; i <= m; i++)
			tot += LCP(1, i);
		ans = max(ans, tot);
	}
	printf("%d\n", ans);
	return 0;
}