#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define SN 200005
int N,n,m,c[SN];
char s[SN],t[SN];

int num;
int vis[200];
pair<int,int> x[60];
unsigned int C,X;int nxt[SN],S[SN],T[SN],lc[SN];
ll f[SN][60],pre[SN];
vector<int> G;
int main(){
    srand(time(0));
    scanf("%s%s",s+1,t+1);N=strlen(s+1),m=strlen(t+1);
    for(int i=1;i<=N;i++)scanf("%d",&c[i]);

    memset(vis,0,sizeof(vis));
    for(int i=1;i<=m;i++)if(!vis[t[i]])vis[t[i]]=1,x[++num]={i,t[i]};
    memset(vis,0,sizeof(vis));
    for(int i=m;i;i--)if(!vis[t[i]])vis[t[i]]=1,x[++num]={i,t[i]};
    sort(x+1,x+1+num);num=unique(x+1,x+1+num)-x-1;

    memset(f,-0x3f,sizeof(f));
    for(int i=0;i<=N;i++)f[i][0]=0;
    x[num+1].first=m+1;
    for(int j=1;j<=num;j++){
        n=m=C=0;
        for(int i=0;i<26;i++){
            bool f=false,g=false;
            for(int k=1;k<=j;k++)f|=x[k].second==j+'a';
            for(int k=j+1;k<=num;k++)g|=x[k].second==j+'a';
            C|=(f&&g)<<i;
        }
        X=C;
        C|=1<<(x[j].second-'a');T[++m]=x[j].second;
        for(int i=x[j].first+1;i<x[j+1].first;i++)T[++m]+=t[i];
        for(int i=1;i<=N;i++)if(C>>(s[i]-'a')&1)S[++n]=s[i],lc[n]=i,pre[n]=c[i]+pre[n-1]; 
        for(int i=2,j=0;i<=n;nxt[i++]=(T[j]==T[i]))
            while(j&&T[j]!=T[i])j=nxt[j];
        for(int i=1,k=0;i<=n;i++){
            while(k&&T[k+1]!=S[i])k=nxt[k];
            k+=T[k+1]==S[i];
            if(k==m)f[lc[i]][j]=max(f[lc[i]][j],f[lc[i-m+1]-1][j-1]+pre[i]-pre[i-m]);
        }
        for(int i=1;i<=N;i++)if(~X>>(s[i]-'a')&1)f[i][j]=max(f[i][j],f[i-1][j]);
    }
    
    if(f[N][num]<0)return puts("You better start from scratch man..."),0;
    f[N][num]=-f[N][num];
    for(int i=1;i<=N;i++)f[N][num]+=c[i];
    printf("%lld\n",f[N][num]);
}