#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod1=998244353;
const int mod2=1000000007;
const int base1=97;
const int base2=37;

ll h1[2050],h2[2050];
ll pw1[2050],pw2[2050];
string str;
ll val[2050][30],nxt[2050][30];
ll dp[2050][2050];
int n,m;

void upd(ll &a,ll b){if (a<=b) a=b;}

void prepare(){
	pw1[0]=1;
	for (int i=1;i<=2000;i++) pw1[i]=pw1[i-1]*base1%mod1;
	pw2[0]=1;
	for (int i=1;i<=2000;i++) pw2[i]=pw2[i-1]*base2%mod2;
}
ll geth1(int l,int r){
	if (l>r) return 0;
	return (h1[r]-h1[l-1]*pw1[r-l+1]%mod1+mod1)%mod1;
}
ll geth2(int l,int r){
	if (l>r) return 0;
	return (h2[r]-h2[l-1]*pw2[r-l+1]%mod2+mod2)%mod2;
}

int main(){
	ios_base::sync_with_stdio(false);
	prepare();
	
	cin >> str;
	m=str.length();
	str=" "+str;
	cin >> n;
	
	for (int i=1;i<=m;i++){
		h1[i]=(h1[i-1]*base1+str[i]-'a')%mod1;
		h2[i]=(h2[i-1]*base2+str[i]-'a')%mod2;
	}
	
	for (int i=0;i<=m;i++){
		for (int c=0;c<26;c++){
			for (int len=1;len<=i+1 && len<=m;len++){
				ll tmph1=(geth1(i+1-len+1,i)*base1+c)%mod1;
				ll tmph2=(geth2(i+1-len+1,i)*base2+c)%mod2;
				if (tmph1==h1[len] && tmph2==h2[len]){
					nxt[i][c]=len;
					val[i][c]++;
				}
			}
		}
	}
	
	for (int i=0;i<=n+10;i++)
		for (int j=0;j<=m+10;j++) dp[i][j]=-1e9;
	dp[0][0]=0;
	
	for (int i=1;i<=n;i++)
		for (int j=0;j<=m;j++)
			for (int c=0;c<26;c++) upd(dp[i][nxt[j][c]],dp[i-1][j]+val[j][c]); 
	/*
	for (int i=1;i<=n;i++){
		for (int j=0;j<=m;j++) cerr << dp[i][j] << " ";
		cerr << "\n";	
	}
	*/
	ll ans=0;
	for (int j=0;j<=m;j++) ans=max(ans,dp[n][j]);
	cout << ans << "\n";
	return 0;
}