#include <bits/stdc++.h>
#define N 2005
#define fi first
#define se second
using namespace std;

char s[N]; 
int n, m, nxt[N];
vector<pair<int,int> > v[N];
int dp[N][N];

int main() {
	scanf("%s %d", s+1, &m); n = strlen(s+1);
	for (int i = 2, j = 0; i <= n; i++) {
		while (j && s[i] != s[j+1]) j = nxt[j];
		if (s[i] == s[j+1]) ++j;
		nxt[i] = j;
	} 
	for (int i = 0; i <= n; i++) {
		for (int c = 0; c < 26; c++) {
			int j = i, k = 0;
			while (j) {
				if (c != s[j+1]-'a') k += j;
				j = nxt[j]; 
			}
			j = i; while (j && c != s[j+1]-'a') j = nxt[j];
			if (c == s[j+1]-'a') ++j;
			v[i].push_back({j,k});
		}
		sort(v[i].begin(),v[i].end()); 
		v[i].resize(unique(v[i].begin(),v[i].end())-v[i].begin());
	}
	memset(dp, -0x3f, sizeof(dp));
	dp[0][0] = 0;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j <= n; j++) {
			for (auto p : v[j]) {
				dp[i+1][p.fi] = max(dp[i+1][p.fi], dp[i][j]+p.se);
			}
		} 
	}
	int ans = 0;
	for (int i = 0; i <= n; i++) {
		int j = i, k = 0;
		while (j) k += j, j = nxt[j];
		ans = max(ans, dp[m][i]+k);
	}
	printf("%d\n", ans);
	return 0;
}