#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

#define DEBUG_VAR(x) { cerr << "* "#x" = " << x << endl; }
#define DEBUG_ARR(arr, l, r) { \
    cerr << "* "#arr"[" << l << ", " << r << "]:"; \
    for(auto it = l, itr = r; it <= itr; it++) \
        cerr << arr[it] << ", "; \
    cerr << endl; \
}
#define DEBUG_FMT(...) { cerr << "* "; fprintf(stderr, __VA_ARGS__); }
#define DEBUG_HERE { DEBUG_FMT("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__); } 

using namespace std;
using LL = long long;
using ULL = unsigned long long;

template<class T> 
inline void relax(T& x, const T& y) { x = (x > y) ? x : y; }

const int N = 2e3 + 5;
const LL INF = 0x3f3f3f3f3f3f3f3f;

struct Node
{
    int ch[26];
    int fail;
    int len;
} t[4 * N];
int tot = 0;

void insert(char a[])
{
    int cur = 0;
    for(int i = 1; a[i]; i++) {
        int& son = t[cur].ch[a[i] - 'a'];
        if(!son) {
            son = ++tot;
            t[son].len = i;
        }
        cur = son;
    }
}

void ACbuild()
{
    queue<int> q;
    for(int i = 0; i < 26; i++) {
        if(t[0].ch[i]) q.push(t[0].ch[i]);
    }

    while(q.size()) {
        int x = q.front(); q.pop();
        for(int i = 0; i < 26; i++) {
            if(t[x].ch[i]) {
                t[t[x].ch[i]].fail = t[t[x].fail].ch[i];
                q.push(t[x].ch[i]);
            } else {
                t[x].ch[i] = t[t[x].fail].ch[i];
            }
        }
    }
}

int n, m;
char a[N];
LL f[N][N];

int dep[N];

int main()
{
    // freopen("1.in", "r", stdin);

    scanf("%s", a + 1);
    scanf("%d", &m);
    n = strlen(a + 1);

    insert(a);
    ACbuild();

    dep[0] = 0;
    for(int i = 1; i <= tot; i++) {
        dep[i] = dep[t[i].fail] + 1;
    }

    memset(f, -0x3f, sizeof f);

    f[0][0] = 0;
    for(int i = 0; i < m; i++) {
        for(int j = 0; j <= tot; j++) {
            if(f[i][j] < 0) continue;

            for(int c = 0; c < 26; c++) {
                int son = t[j].ch[c];
                relax(f[i + 1][son], f[i][j] + dep[son]);
            }
        }
    }

    LL ans = -INF;
    for(int i = 0; i <= tot; i++) {
        relax(ans, f[m][i]);
    }
    printf("%lld\n", ans);
    return 0;
}