#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2010;
int n,m,nxt[N];
ll ans;
char a[N];
string s;
int main () {
    freopen("string.in","r",stdin);
    freopen("string.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin >> a+1;
    m=strlen(a+1);
    cin >> n;
    s.push_back(' ');
    for (int i=1;i<=n;i++) {
        ll sum=n;
        s.push_back(a[i]);
        int t=s.size()-1,p;
        for (int j=1;j<=(m-t)/t;j++) {
            int flag=0;
            for (int k=j*t+1;k<=(j+1)*t;k++) {
                if (a[k]!=s[k-j*t]) {
                    flag=1;
                    break;
                } 
            }
            if (flag) break;
            sum+=t*(n/t-j);
            p=j;
        }
        ans=max(ans,sum);
    }
    cout << ans <<endl;
    return 0;
}