#include<bits/stdc++.h>
using namespace std;
int n,m,ss[2005],dp[2005][2005],nt[2005];
unsigned long long hs[2005],ab[2005];
struct vv{
    int a1,a2;
};
vector<vv>v[2005];
const unsigned long long B=29;
string s;
inline unsigned long long f(int x,int y){
    if(x>y) return 0;
    return hs[y]-hs[x-1]*ab[y-x+1];
}
int main(){
    freopen("string.in","r",stdin);
    freopen("string.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>s>>n,m=s.size(),s=' '+s,ab[0]=1;
    for(int i=1;i<=m;i++) hs[i]=(hs[i-1]*B+(s[i]-'a'+1)),ab[i]=ab[i-1]*B;
    for(int i=2,j=0;i<=m;i++){
        while(j&&s[j+1]!=s[i]) j=nt[j];
        if(s[j+1]==s[i]) j++;
        nt[i]=j;
    }
    for(int i=1;i<=m;i++){
        for(int j=1;j<=i;j++){
            int l=0,r=i-j+1,md;
            while(l<=r){
                md=(l+r)>>1;
                if(f(1,md)==f(j,j+md-1)) l=md+1;
                else r=md-1;
            }
            ss[j]=ss[j-1]+l-1;
        }
        int p=nt[i];
        while(p){
            v[i].push_back({p,ss[i-p]});
            p=nt[p];
        }
        v[i].push_back({0,ss[i]});
    }
    for(int i=n;i>=1;i--){
        for(int j=n-i+1;j>=0;j--){
            dp[i][j]=dp[i][j+1];
            for(int k=0;k<v[j].size();k++){
                int ps=dp[i+j-v[j][k].a1][v[j][k].a1]+v[j][k].a2;
                if(ps>dp[i][j]) dp[i][j]=ps;
            }
        }
    }
    cout<<dp[1][0];
    return 0;
}