#include <bits/stdc++.h>

using namespace std;

//#define  ll long long
//#define ld long double
//#define f first
//#define s second
const int N = 1e5+500;

int n , m , lf[N] , rt[N] , id = 2;
string s;
map< pair<int,int> , int> mp;

void dfs(int node)
{
    if (!lf[node])
    {
        char c;
        if (node == 1) c = 'a';
        else c = 'b';
        if (id >= (int)s.size() || c != s[id])
        {
            cout << "NO\n";
            exit(0);
        }
        id++;
    }
    else
    {
        dfs(lf[node]);
        dfs(rt[node]);
    }
}

void solve()
{
    bool f = 0;
    vector<int> v = {1 , 2}; //a , b
    for(int i=1; i<=m; i++)
    {
        string str;
        cin >> str;
        if (f) continue;
        if (str == "copy")
        {
            int tmp = v.back();
            v.push_back(tmp);
        }
        else if (str == "swap")
        {
            if ((int)v.size() < 2)
            {
                f = 1;
                continue;
            }

            int lst = v.back();
            v.pop_back();
            int lstlst = v.back();
            v.pop_back();

            v.push_back(lst);
            v.push_back(lstlst);
        }
        else if (str == "roll")
        {
            if ((int)v.size() < 3)
            {
                f = 1;
                continue;
            }
            vector<int> tmp;
            for(int j=(int)v.size()-1; j>=(int)v.size()-3; j--)
                tmp.push_back(v[j]);

            reverse(tmp.begin() , tmp.end());
            v.pop_back();
            v.pop_back();
            v.pop_back();
            v.push_back(tmp[1]);
            v.push_back(tmp[2]);
            v.push_back(tmp[0]);
        }
        else
        {
            if ((int)v.size() < 2)
            {
                f = 1;
                continue;
            }

            int tmp = v[(int)v.size()-2] , tmp2 = v.back();
            v.pop_back();
            v.pop_back();
            if (mp.count({tmp , tmp2}))
                {}
            else
            {
                ++id;
                mp[{tmp , tmp2}] = id;
            }

            int num = mp[{tmp , tmp2}];
            lf[num] = tmp;
            rt[num] = tmp2;
            v.push_back(num);
        }
    }

    if (f)
    {
        cout << "CRASH\n";
        return;
    }

    id = 0;
    dfs(v.back());
    if (id < s.size()) cout << "NO\n";
    else cout << "YES\n";
}


int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> s;
    n = s.size();

    cin >> m;

    solve();

    return 0;
}