#include<bits/stdc++.h>
using namespace std;
int n,ans;
string s;
bool vis[150];
int pre(string x){
    int cnt=0;
    for(int i=0;i<min(x.size(),s.size());i++){
        if(x[i]!=s[i])break;
        cnt++;
    }
    return cnt;
}
int solve(string x){
    int cnt=0;
    string l="";
    for(int i=x.size()-1;i>=0;i--){
        string t="";
        t+=x[i];
        l=t+l;
        cnt+=pre(l);
    }
    return cnt;
}
void dfs(int d,string x){
    //cout<<d<<"\n";
    if(d==n){
        ans=max(ans,solve(x));
        return;
    }
    for(int i='a';i<='z';i++){
        if(!vis[i])continue;
        char c=i;
        string l="";
        l+=c;
        dfs(d+1,x+l);
    }
}
int main(){
    freopen("string.in","r",stdin);
    freopen("string.out","w",stdout);
    cin>>s>>n;
    string l="";
    for(int i=0;i<s.size();i++){
        int x=s[i];
        vis[x]=1;
    }
    dfs(0,l);
    cout<<ans;
    return 0;
}