#include <bits/stdc++.h>
using namespace std;;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using uint = unsigned int;
const double EPS = 1e-8;
const int INF = 0x3F3F3F3F;
const ll LINF = 46 * ll(1e17);
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 25;

vector<int> kmp(const string &s) {
    int n = s.size();
    vector<int> dp(n);
    for (int i = 1, j = 0; i < n; i++) {
        while (j && s[i] != s[j])
            j = dp[j - 1];
        if (s[i] == s[j])
            j++;
        dp[i] = j;
    }
    return dp;
}
const int N = 2007;
int dp[N][N];
signed main() { ios::sync_with_stdio(0); cin.tie(0);
    string s;
    int n;
    cin >> s >> n;
    auto k = kmp(s);
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            dp[i][j] = -INF;
    dp[0][0] = 0;
    vector<int> dep(s.size() + 1);
    dep[1] = 1;
    for (int i = 2; i <= s.size(); i++)
        dep[i] = dep[k[i - 1]] + 1;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (dp[i][j] < 0)
                continue;
            //cerr << i << ' ' << j << ' ' << dp[i][j] << '\n';
            for (char c = 'a'; c <= 'z'; c++) {
                int nxt = j;
                if (nxt == s.size())
                    nxt = k[nxt - 1];
                while (nxt && s[nxt] != c)
                    nxt = k[nxt - 1];
                if (s[nxt] == c)
                    nxt++;
                dp[i + 1][nxt] = max(dp[i + 1][nxt], dp[i][j] + dep[nxt]);
            }
        }
    }
    int mx = 0;
    for (int i = 0; i <= n; i++)
        mx = max(mx, dp[n][i]);
    cout << mx << '\n';
}