#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll i,j,p,q,m,k,price[30],A,M,B,D,H,Score,minScore,d,l,r,step[30];
clock_t T;
string redici[30],nach[30];
string text;
string f;
ll place[30];
unordered_map <char,ll> used;
stack <char> st;
pair <ll,char> alphabet[30];
ll len;
struct Answer
{
    vector <string> red;
    vector <pair<string,ll>> operations;
} ans,tek;
void read()
{
    freopen("printing.in","r",stdin);
    freopen("printing.out","w",stdout);
}
void input()
{
    cin>>d;
    d--;
    cin>>text;
    cin>>A>>B>>M>>D>>H;
    for(i=1; i<=27; i++)
        cin>>price[i];
}
void output()
{
    //cout<<minScore<<endl;
    cout<<ans.red.size()<<endl;
    for(auto i:ans.red)
        cout<<i<<endl;
    cout<<ans.operations.size()<<endl;
    for(auto p:ans.operations)
    {
        cout<<p.first;
        if(p.first=="cd" || p.first=="w")
            cout<<" "<<p.second;
        cout<<endl;
    }
}
ll Code(char c)
{
    if(isalpha(c))
        return (c-'a'+1);
    return 27;
}
ll Calc(ll g)
{
    ll ans=0;
    for(i=1; i<=g; i++)
        ans+=M/i;
    return ans;
}
ll Find(string s,char c)
{
    int ds = s.size()-1,h,as;
    for(h=0; h<=ds; h++)
        if(s[h]==c)
            return h;
}
int main()
{
    srand(time(NULL));
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    minScore=LLONG_MAX;
    read();
    input();
    step[0]=1;
    for(i=1;i<=29;i++)
        step[i]=step[i-1]*2;
    for(i=0; i<=d; i++)
    {
        used[text[i]]++;
    }
    for(char c='a'; c<='z'; c++)
    {
        if(used[c]>0)
            alphabet[++len]=make_pair(-used[c],c);
    }
    if(used['_']>0)
        alphabet[++len]=make_pair(-used['_'],'_');
    sort(alphabet+1,alphabet+len+1);
    ll br_red;
    for(ll br_red=1; br_red<=min(27ll,len); br_red++)
    {

        while(!st.empty())
            st.pop();
        tek.operations.clear();
        Score=price[br_red];
        for(i=1; i<=br_red-1; i++)
            redici[i]="";
        p=len/br_red;
        q=1;
        //if(used['_']>0)redici[1].push_back('_');
        //place[27]=1;
        for(j=1; j<=br_red; j++)
        {
            for(i=q; i<=q+p-1; i++)
            {
                redici[j].push_back(alphabet[i].second);
                place[Code(alphabet[i].second)]=j;
            }
            q=q+p;
        }
        for(i=q; i<=len; i++)
        {
            redici[br_red].push_back(alphabet[i].second);
            place[Code(alphabet[i].second)]=br_red;
        }
/**
        for(i=1;i<=br_red;i++)
            cout<<redici[i]<<"   ";
        cout<<endl;
*/
        tek.red.clear();
        for(j=1; j<=br_red; j++)
            tek.red.push_back(redici[j]);
        i=0;
        while(i<=d)
        {
            p = place[Code(text[i])];
            if((tek.operations.empty() && p!=1) || tek.operations.empty()==0)
            {
                tek.operations.push_back(make_pair("cd",p));
                Score+=D;
            }
            j=i+1;
            bool fl=0;
            while(j<=d && place[Code(text[j])]==place[Code(text[j-1])])
            {
                j++;
            }
            ///vsichko mejdu i i j e na edno i sushto mqsto
            j=min(j,d);
            if(place[Code(text[j])]!=place[Code(text[i])])j--;
            l=i;
            r=j;
            for(j=l; j<=r; j++)
            {
                //cout<<redici[p][0]<<"  redici [p][0] "<<endl;
                k=0;
                while(j<=r && (redici[p][k]==text[j]))
                {
                    //cout<<text[j]<<" "<<used[text[j]]<<endl;
                    used[text[j]]--;
                    k++;
                    j++;
                }
                if(j>r)
                {
                    k--;
                    tek.operations.push_back(make_pair("w",k+1));
                    Score+=Calc(k+1);
                    f=redici[p].substr(0,k+1);
                    //cout<<f<<endl;
                    redici[p]=redici[p]+f;
                    redici[p].erase(0,k+1);
                    break;
                }
                if(k==0)
                {
                    ///koq ot dvete rotacii e po - udachna
                    if(used[redici[p][0]]<=0)
                    {
                        tek.operations.push_back(make_pair("push",0));
                        st.push(redici[p][0]);
                        redici[p].erase(0,1);
                        Score+=H;
                    }
                    else
                    {
                        ll pos = Find(redici[p],text[j]);
                        if(pos<=redici[p].size()/2 || (pos)*A<(redici[p].size()-pos)*B)
                        {
                            tek.operations.push_back(make_pair("cl",0));
                            Score+=A;
                            redici[p].push_back(redici[p][0]);
                            redici[p].erase(0,1);
                        }
                        else
                        {
                            tek.operations.push_back(make_pair("cr",0));
                            Score+=B;
                            redici[p]=(redici[p][redici[p].size()-1])+redici[p];
                            redici[p].erase(redici[p].size()-1,1);
                        }
                    }
                }
                else
                {
                    k--;
                    tek.operations.push_back(make_pair("w",k+1));
                    Score+=Calc(k+1);
                    f=redici[p].substr(0,k+1);
                    // cout<<f<<endl;
                    redici[p]=redici[p]+f;
                    redici[p].erase(0,k+1);
                }
                j--;
            }
            i=r+1;
        }
        /**(auto p:tek.operations)
        {
            cout<<p.first<<" "<<p.second<<endl;
        }*/

        if(Score<minScore)
        {
            //cout<<br_red<<" "<<Score<<endl;
            minScore=Score;
            ans=tek;
        }
        for(i=0; i<=d; i++)
        {
            used[text[i]]++;
        }
    }
    for(ll Dnum=step[len-1]-1;Dnum>=0;Dnum--)
    {
        T=clock();
        if(T>=4200)break;
        while(!st.empty())
            st.pop();
        tek.operations.clear();

        f="";br_red=0;
        for(i=len-1;i>=0;i--)
        {
            if((step[i]&Dnum))
            {
                nach[++br_red]=f;
                f=alphabet[len-i].second;
            }
            else f.push_back(alphabet[len-i].second);
        }
        nach[++br_red]=f;
        p=br_red;br_red=0;
        for(i=1;i<=p;i++)
            if(nach[i]!="")redici[++br_red]=nach[i];
        for(i=1;i<=br_red;i++)
        {
            for(auto j:redici[i])
                place[Code(j)]=i;
        }
/**

        cout<<br_red<<" :  ";
        for(i=1;i<=br_red;i++)
            cout<<redici[i]<<"   ";
        //cout<<endl;
        */

/**
        for(i=1;i<=len;i++)
            cout<<place[Code(alphabet[i].second)]<<endl;
*/
        Score=price[br_red];

        tek.red.clear();
        for(j=1; j<=br_red; j++)
            tek.red.push_back(redici[j]);
        i=0;
        while(i<=d)
        {
            p = place[Code(text[i])];
            if((tek.operations.empty() && p!=1) || tek.operations.empty()==0)
            {
                tek.operations.push_back(make_pair("cd",p));
                Score+=D;
            }
            j=i+1;
            bool fl=0;
            while(j<=d && place[Code(text[j])]==place[Code(text[j-1])])
            {
                j++;
            }
            ///vsichko mejdu i i j e na edno i sushto mqsto
            j=min(j,d);
            if(place[Code(text[j])]!=place[Code(text[i])])j--;
            l=i;
            r=j;
            for(j=l; j<=r; j++)
            {
                //cout<<redici[p][0]<<"  redici [p][0] "<<endl;
                k=0;
                while(j<=r && (redici[p][k]==text[j]))
                {
                    //cout<<text[j]<<" "<<used[text[j]]<<endl;
                    used[text[j]]--;
                    k++;
                    j++;
                }
                if(j>r)
                {
                    k--;
                    tek.operations.push_back(make_pair("w",k+1));
                    Score+=Calc(k+1);
                    f=redici[p].substr(0,k+1);
                    //cout<<f<<endl;
                    redici[p]=redici[p]+f;
                    redici[p].erase(0,k+1);
                    break;
                }
                if(k==0)
                {
                    ///koq ot dvete rotacii e po - udachna
                    if(used[redici[p][0]]<=0)
                    {
                        tek.operations.push_back(make_pair("push",0));
                        st.push(redici[p][0]);
                        redici[p].erase(0,1);
                        Score+=H;
                    }
                    else
                    {
                        ll pos = Find(redici[p],text[j]);
                        if(pos<=redici[p].size()/2 || (pos)*A<(redici[p].size()-pos)*B)
                        {
                            tek.operations.push_back(make_pair("cl",0));
                            Score+=A;
                            redici[p].push_back(redici[p][0]);
                            redici[p].erase(0,1);
                        }
                        else
                        {
                            tek.operations.push_back(make_pair("cr",0));
                            Score+=B;
                            redici[p]=(redici[p][redici[p].size()-1])+redici[p];
                            redici[p].erase(redici[p].size()-1,1);
                        }
                    }
                }
                else
                {
                    k--;
                    tek.operations.push_back(make_pair("w",k+1));
                    Score+=Calc(k+1);
                    f=redici[p].substr(0,k+1);
                    // cout<<f<<endl;
                    redici[p]=redici[p]+f;
                    redici[p].erase(0,k+1);
                }
                j--;
            }
            i=r+1;
        }
        /**(auto p:tek.operations)
        {
            cout<<p.first<<" "<<p.second<<endl;
        }*/
        //cout<<" "<<Score<<endl;
        if(Score<minScore)
        {
            //cout<<br_red<<" "<<Score<<endl;
            minScore=Score;
            ans=tek;
        }
        for(i=0; i<=d; i++)
        {
            used[text[i]]++;
        }
    }
    output();
    return 0;
}
/**
21
hello_can_you_hear_me
1 2 3 4 5
1 2 3 4 5 6 7 8 9 10
11 12 13 14 15 16 17 18 19 120
21 22 23 24 25 26 27
*/