#include<bits/stdc++.h>
#define ull unsigned long long
#define pb push_back
#define ll long long
using namespace std;
const int N=2e5+5,P=113;
const ll INF=1e18;
int n,m,w[N],sz,id[N],pos[N];
char s[N],t[N],ss[N];
int le[26],ri[26],tot=1,l[58],r[58];
bool vis[26],alp[58][26];
ull pw[N],h[N],hh[N];
ull get(int l,int r,int k){
    if(!k) return hh[r]-hh[l-1]*pw[r-l+1]; 
    return h[r]-h[l-1]*pw[r-l+1]; 
}
ll dp[N][58],sum[N];
void Min(ll &x,ll y){ x=x<y?x:y; }
int main(){
    // freopen("data.in","r",stdin);
    scanf("%s\n%s",s+1,t+1),n=strlen(s+1),m=strlen(t+1);
    pw[0]=1; for(int i=1;i<=n;++i) scanf("%d",&w[i]),pw[i]=pw[i-1]*P;
    for(int i=1;i<=m;++i) (!le[t[i]-'a'])&&(le[t[i]-'a']=i),ri[t[i]-'a']=i;
    l[1]=1; for(int i=1;i<=m;++i){
        if(le[t[i]-'a']==i) r[tot]=i-1,memcpy(alp[tot],vis,sizeof(vis)),vis[t[i]-'a']=true,++tot,l[tot]=i;
        if(ri[t[i]-'a']==i) r[tot]=i,memcpy(alp[tot],vis,sizeof(vis)),vis[t[i]-'a']=false,l[++tot]=i+1;
        // if(le[t[i]-'a']==i) r[tot-1]=i-1,vis[t[i]-'a']=true,++tot,l[tot]=r[tot]=i,memcpy(alp[tot],vis,sizeof(vis));
        // if(ri[t[i]-'a']==i) r[tot]=i,memcpy(alp[tot],vis,sizeof(vis)),vis[t[i]-'a']=false,r[tot]=i,++tot,l[tot]=i+1,r[tot]=i,memcpy(alp[tot],vis,sizeof(vis));
        hh[i]=hh[i-1]*P+t[i];
    }
    r[tot]=m;
    // for(int i=1;i<=tot;++i) cout<<i<<": "<<l[i]<<" "<<r[i]<<" "<<alp[i][0]<<endl;
    for(int i=0;i<=n;++i) for(int j=0;j<=tot;++j) dp[i][j]=INF;
    dp[0][0]=dp[0][1]=0;
    for(int j=0;j<=tot;++j){
        sz=0; for(int i=1;i<=n;++i){
            sum[i]=sum[i-1];
            if(alp[j+1][s[i]-'a']) ss[++sz]=s[i],pos[sz]=i,id[i]=sz;
            else id[i]=sz+1,sum[i]+=w[i];
        }
        for(int i=1;i<=sz;++i) h[i]=h[i-1]*P+ss[i];

        for(int i=0;i<=n;++i) if(dp[i][j]<INF){
            if(!alp[j][s[i+1]-'a']) Min(dp[i+1][j],dp[i][j]+w[i+1]);
            if(r[j+1]-l[j+1]+1==0){
                if(!alp[j+1][s[i+1]-'a']) Min(dp[i+1][j+1],dp[i][j]+w[i+1]);
                Min(dp[i][j+1],dp[i][j]);
            }else{
                int st=id[i+1],ed=id[i+1]+r[j+1]-l[j+1];
                if(ed<=sz&&get(st,ed,j+1)==get(l[j+1],r[j+1],0)) Min(dp[pos[ed]][j+1],dp[i][j]+sum[pos[ed]]-sum[i]);
            }
        }
    }
    if(dp[n][tot]==INF) puts("You better start from scratch man...");
    else printf("%lld\n",dp[n][tot]);

    return 0;
}