#include <bits/stdc++.h>
//#define int long long

using namespace std;

const int O = 2e3 + 5;
const int mod = 998244353;
const int lim = 'z' - 'a';

bool lcp[O][O];
int n, m, f[O][O], nxt[27][O], weight[O];
string s;

void Maximize(int &x, int y){
    if (x < y) x = y;
}

main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    if (fopen("input.in", "r")){
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }

    cin >> s >> n;
    m = s.size(); s = " " + s;

    /*string cur = "";
    map<string, bool> dd;
    for (int i = 1; i <= m; ++ i){
        cur += s[i];
        reverse(cur.begin(), cur.end());
        dd[cur] = 1;
        reverse(cur.begin(), cur.end());
    }*/

    lcp[0][0] = true;
    for (int i = 1; i <= m; ++ i){
        lcp[i][0] = true;
        for (int j = 1; j <= i; ++ j){
            lcp[i][j] = (lcp[i - 1][j - 1] & (s[i] == s[j]));
        }
    }

    for (int i = 1; i <= m; ++ i){
        //cur = "";
        for (int j = 1; j <= i; ++ j){
            //cur += s[i - j + 1];
            weight[i] += lcp[i][j];
        }
        //cout << weight[i] << endl;
    }

    for (int i = 0; i <= m; ++ i){
        //cur += s[i];
        for (int j = 0; j <= lim; ++ j){
            /*string nw = "";
            nw += char(j + 'a');
            if (dd[nw]) nxt[j][i] = 1;
            for (int z = i; z >= 1; -- z){
                nw += s[z];
                if (dd[nw]){
                    Maximize(nxt[j][i], i - z + 2);
                }
            }*/
            for (int z = 0; z <= i; ++ z){
                if (j + 'a' == s[z + 1] && lcp[i][z]) Maximize(nxt[j][i], z + 1);
            }
        }
    }

    /*for (int i = 0; i <= 2; ++ i){
        for (int j = 0; j <= m; ++ j){
            cout << j << " " << char(i + 'a') << " " << nxt[i][j] << endl;
        }
    }*/

    memset(f, -1, sizeof(f));

    f[0][0] = 0;
    for (int i = 0; i < n; ++ i){
        for (int j = 0; j <= m; ++ j){
            if (f[j][i] == -1) continue;
            for (int z = 0; z <= lim; ++ z){
                Maximize(f[nxt[z][j]][i + 1], f[j][i] + weight[nxt[z][j]]);
            }
        }
    }

    int res = 0;
    for (int i = 0; i <= m; ++ i) Maximize(res, f[i][n]);

    cout << res;

}