#include <bits/stdc++.h>

using namespace std;

template<typename T> inline bool upmin(T &x, T y) { return y < x ? x = y, 1 : 0; }
template<typename T> inline bool upmax(T &x, T y) { return x < y ? x = y, 1 : 0; }

#define MP(A,B) make_pair(A,B)
#define PB(A) push_back(A)
#define SIZE(A) ((int)A.size())
#define LEN(A) ((int)A.length())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double lod;
typedef pair<ll, ll> PR;
typedef vector<int> VI;

const lod eps = 1e-9;
const lod pi = acos(-1);
const int oo = 1 << 30;
const ll loo = 1ll << 60;
const int MAXN = 2005;
const int MAXM = 1000005;
const int MAXP = 7000000;
//const int MX = 67;
const int G = 3;
const int mods = 1e7 + 9;
const int Gi = (mods + 1) / G;
const int SZ = 29;
const int inv2 = (mods + 1) >> 1;
const int INF = 0x3f3f3f3f;
/*--------------------------------------------------------------------*/


namespace FastIO{
	constexpr int SIZE = (1 << 21) + 1;
	int num = 0, f;
	char ibuf[SIZE], obuf[SIZE], que[65], *iS, *iT, *oS = obuf, *oT = obuf + SIZE - 1, c;
	#define gc() (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)), (iS == iT ? EOF : *iS ++)) : *iS ++)
	inline void flush() {
		fwrite(obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	inline void putc(char c) {
		*oS ++ = c;
		if (oS == oT) flush();
	}
	inline void getc(char &c) { for (c = gc(); c <= ' ' ; c = gc()); }
	inline void reads(char *st) {
		char c;
		for (c = gc(); c <= ' ' ; c = gc());
		for (; c > ' ' ; *st ++ = c, c = gc());
		*st = 0;
	}
	template<class I>
	inline void read(I &x) {
		for (f = 1, c = gc(); c < '0' || c > '9' ; c = gc()) if (c == '-') f = -1;
		for (x = 0; c >= '0' && c <= '9' ; c = gc()) x = (x << 3) + (x << 1) + (c & 15);
		x *= f;
	}
	template<class I>
	inline void print(I x) {
		if (x < 0) putc('-'), x = -x;
		if (!x) putc('0');
		while (x) que[++ num] = x % 10 + 48, x /= 10;
		while (num) putc(que[num --]);
	}
	inline void putstr(string st) { for (int i = 0; i < (int)st.size() ; ++ i) putc(st[i]); }
	struct Flusher_{~Flusher_(){flush();}} io_Flusher_;
}
using FastIO :: read;
using FastIO :: putc;
using FastIO :: putstr;
using FastIO :: getc;
using FastIO :: reads;
using FastIO :: print;

/*------------------------------------------------------------*/


int Z[MAXN], nxt[MAXN], f[MAXN][MAXN], n;
char st[MAXN];

void InitZ(char *S) {
	int len = strlen(S + 1);		
	for (int i = 2, l = 0, r = 0; i <= len ; ++ i) {
		if (i <= r) Z[i] = min(Z[i - l + 1], r - i + 1);
		while (i + Z[i] <= len && S[Z[i] + 1] == S[i + Z[i]]) ++ Z[i];
		if (i + Z[i] - 1 > r) l = i, r = i + Z[i] - 1;
	}
	for (int i = 1; i <= len ; ++ i) Z[i] += Z[i - 1];
}
void Init(char *S) {
	int len = strlen(S + 1);
	for (int i = 2, j = 0; i <= len ; ++ i) {
		while (j && S[i] != S[j + 1]) j = nxt[j];
		if (S[i] == S[j + 1]) ++ j;
		nxt[i] = j;
	}
}
signed main() {
#ifndef ONLINE_JUDGE
	freopen("a.in", "r", stdin);
#endif
	scanf("%s%d", st + 1, &n);
	int len = strlen(st + 1);
	InitZ(st);
	Init(st);
	for (int i = 0; i <= n + 1 ; ++ i)
		for (int j = 0; j <= len + 1 ; ++ j) f[i][j] = -INF;
	f[0][0] = 0;
	for (int i = 1; i <= n ; ++ i) {
		for (int j = 0; j <= len ; ++ j) 
			if (i - (j - nxt[j]) >= 0) f[i][j] = max(f[i][j], f[i - (j - nxt[j])][nxt[j]] + j + Z[j - nxt[j]]);
		for (int j = len; j >= 0 ; -- j) f[i][j] = max(f[i][j], f[i][j + 1]);
	}
	printf("%d\n", f[n][0]);
	return 0;
}