#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);i++)
#define foR(i,j,k) for(int i=(j);i>=(k);i--) 
#define vi vector<int>
#define pb push_back
#define pii pair<int,int> 
#define mkp make_pair
#define SZ(x) ((int)x.size())
#define int long long
using namespace std;
inline int read() {
	char c;int res=0;bool flag=0;
	while(c=getchar(),c<48)(c=='-')&&(flag=1);
	do res=(res<<3)+(res<<1)+(c^48);
	while(c=getchar(),c>47);
	flag&&(res=-res); return res; 
}
char c[2003];
int n,m,f[2003][2003],fa[2003],g[2003],to[2003][203],ans;
signed main(){
	scanf("%s",c+1);
	n=strlen(c+1);
	m=read();
	fa[0]=-1;
	for(int i=1;i<=n;++i){
		int x=fa[i-1];
		while(x!=-1){
			if(c[x+1]==c[i])break;
			x=fa[x];
		}
		fa[i]=x+1;
		g[i]=g[fa[i]]+1;
	}
	for(int j='a';j<='z';++j){
		to[0][j]=0;
	}
	to[0][c[1]]=1;
	for(int i=1;i<=n;++i){
		for(int j='a';j<='z';++j){
			if(j==c[i+1])to[i][j]=i+1;
			else to[i][j]=to[fa[i]][j];
		}
	}
	for(int i=0;i<=m;++i){
		for(int j=0;j<=n;++j){
			f[i][j]=-1e9;
		}
	}
	f[0][0]=0;
	for(int i=1;i<=m;++i){
		for(int j=0;j<=n;++j){
			for(int c='a';c<='z';++c){
				if(f[i][to[j][c]]<f[i-1][j]+g[to[j][c]]){
					f[i][to[j][c]]=f[i-1][j]+g[to[j][c]];
				}
			}
		}
	}
	for(int i=0;i<=n;++i){
		if(f[m][i]>ans)ans=f[m][i];
	}
	cout<<ans;
}