#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2000 + 5;

int N, nxt[MAX_N], f[MAX_N][MAX_N], g[MAX_N];
char a[MAX_N];

void init() {
    int i, j, n = strlen(a + 1);
    for (nxt[1] = j = 0, i = 2; i <= n; nxt[i ++] = j) {
        while (j > 0 && a[j + 1] != a[i]) j = nxt[j];
        if (a[j + 1] == a[i]) j ++;
    }
    for (int i = 2; i <= n; i ++) {
        for (int &j = g[i] = 1; j + i - 1 <= n && a[j] == a[i + j - 1]; j ++);
        g[i] --; g[i] += g[i - 1];
    }
}

int main() {
    scanf("%s\n%d", a + 1, &N);
    init();
    for (int i = 1; i <= N; i ++) {
        for (int j = 1; j <= i; j ++) {
            f[i][j] = f[i - (j - nxt[j])][nxt[j]] + j + g[j - nxt[j]];
        }
        for (int j = i - 1; j >= 0; j --) f[i][j] = max(f[i][j], f[i][j + 1]);
    }
    printf("%d\n", f[N][0]);
    return 0;
}