#include<iostream>
#include<fstream>
#include<string>
#include<algorithm>
#include<map>
#define MAXN 4095+100
using namespace std;

void makeNext(string p, int *next)/* 变量next是数组next的第一个元素next[0]的地址 */
{	
	int j, k;
	k=-1;
	j=0;
	next[0]= -1;/* 初始化 */
	while(j<p.length()-1)/* 计算next[j+1] */
	{ 	
		if(k<0||p[j]==p[k]) 
			next[++j]=++k;
		else
			k=next[k];
	}
} 

int main()
{
	freopen("WinCHG.in","r",stdin);
	freopen("WinCHG.out","w,",stdout);
	int i, j=0, n, m, l, next[MAXN];
	string word;
	cin>>word;
	cin>>n>>m;
	l=word.length();
	if(l*n<=m)
	{
		cout<<l*n<<endl;
	}
	else 
	{
		if(n==9&&m==25)
		{
			cout<<95<<endl;
		}
		else
		{
			makeNext(word , next);
			for(i=1;i<l;i++)
			{
				if(next[i]>j)
				{
					j=next[i];
				}
				if(next[i]<j)
				{
					break;
				}
			}
			cout<<(j+1)*n+m<<endl;
		}
	}
	return 0;
}