http://acm.hdu.edu.cn/showproblem.php?pid=6740
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e7+9;
const int mod=1e9+7;
ll a,b;
char s[maxn],t[maxn];
int cnt=0;
int nex[maxn];
int len;
void kmp_next()
{
int j,k;
j=0;
k=-1;
nex[0]=-1;
while(j<len)
{
if(k==-1||t[j]==t[k]) nex[++j]=++k;
else k=nex[k];
}
}
int main()
{
//FAST_IO;
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
while(~scanf("%lld%lld",&a,&b))
{
sfs(s);
len=strlen(s);
cnt=0;
for(int i=len-1;i>=0;i--)
{
if(s[i]=='.') break;
t[cnt++]=s[i];
}
len=cnt;
kmp_next();
ll ans=a-b;
//cout<<t<<endl;
for(int i=1;i<len;i++)
{
//cout<<nex[i]<<" ";
ans=max(ans,a*(i+1)-b*(i-nex[i+1]+1));
}
//cout<<endl;
printf("%lld\n",ans);
}
return 0;
}