#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

stack<pair<int, int>> S;
map<int, pair<int, int>> P;

string to_string(pair<queue<char>, queue<char>> s)
{
    string ret;
    stack<char> temp;
    while(!s.first.empty())
    {
        temp.push(s.first.front());
        s.first.pop();
    }
    while(!temp.empty())
    {
        ret += temp.top();
        temp.pop();
    }
    while(!s.second.empty())
    {
        ret += s.second.front();
        s.second.pop();
    }
    return ret;
}

pair<queue<char>, queue<char>> find_string(int n)
{
    if(n == 1)
    {
        queue<char> q1({'a'}), q2;
        return make_pair(q1, q2);
    }
    if(n == 2)
    {
        queue<char> q1({'b'}), q2;
        return make_pair(q1, q2);
    }

    int x = P[n].first, y = P[n].second;

    pair<queue<char>, queue<char>> a = find_string(x);
    pair<queue<char>, queue<char>> b = find_string(y);

    if(a.first.size() + a.second.size() < b.first.size() + b.second.size())
    {
        stack<char> temp;
        while(!a.second.empty())
        {
            temp.push(a.second.front());
            a.second.pop();
        }
        while(!temp.empty())
        {
            b.first.push(temp.top());
            temp.pop();
        }
        while(!a.first.empty())
        {
            b.first.push(a.first.front());
            a.first.pop();
        }

        return b;
    }
    else
    {
        stack<char> temp;
        while(!b.first.empty())
        {
            temp.push(b.first.front());
            b.first.pop();
        }
        while(!temp.empty())
        {
            a.second.push(temp.top());
            temp.pop();
        }
        while(!b.second.empty())
        {
            a.second.push(b.second.front());
            b.second.pop();
        }

        return a;
    }
}

void COPY()
{
    S.push(S.top());
}

void SWAP()
{
    if(S.size() < 2)
    {
        cout << "CRASH";
        exit(0);
    }
    else
    {
        pair<int, int> a = S.top();
        S.pop();
        pair<int, int> b = S.top();
        S.pop();

        S.push(a);
        S.push(b);
    }
}

void ROLL()
{
    if(S.size() < 3)
    {
        cout << "CRASH";
        exit(0);
    }
    else
    {
        pair<int, int> a = S.top();
        S.pop();
        pair<int, int> b = S.top();
        S.pop();
        pair<int, int> c = S.top();
        S.pop();

        S.push(b);
        S.push(a);
        S.push(c);
    }
}

void FUSE()
{
    if(S.size() < 2)
    {
        cout << "CRASH";
        exit(0);
    }
    else
    {
        pair<int, int> a = S.top();
        S.pop();
        pair<int, int> b = S.top();
        S.pop();

        S.push({P.size() + 3, min(a.second + b.second, (int) 1e9)});
        P[P.size() + 3] = {b.first, a.first};
    }
}

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

	S.push({1, 1});
    S.push({2, 1});

	string s;
	cin >> s;

	int n;
	cin >> n;
	while(n-->0)
    {
        string command;
        cin >> command;

        if(command == "copy") COPY();
        else if(command == "swap") SWAP();
        else if(command == "roll") ROLL();
        else if(command == "fuse") FUSE();
    }

    if(S.top().second != s.size() || to_string(find_string(S.top().first)) != s) cout << "NO";
    else cout << "YES";
}