#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double


const int N = 1000 + 5, mod = 998244353, OO = 1e5 + 5;

string s;

struct node {
    char type;
    int length;
    vector<node*> children;
};

int n;
stack<node*> st;

void crash() {
    cout << "CRASH\n";
    exit(0);
}

node *merge(node *a, node *b) {
    node *ret = new node();
    if (a->length + b->length > OO) {
        ret->length = OO;
    } else {
        ret->length = a->length + b->length;
        ret->children.push_back(a);
        ret->children.push_back(b);
    }
    return ret;
}

int idx = 0;
bool can = true;

void solve(node *u) {
    if (u->children.empty()) {
        if (u->type != s[idx]) {
            can = false;
        } else {
            ++idx;
        }
    } else {
        for (auto &v : u->children) {
            solve(v);
        }
    }
}

bool solve() {
    solve(st.top());
    return can && idx == st.top()->length;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> s;
    cin >> n;
    node *a = new node(), *b = new node();
    a->type = 'a';
    a->length = 1;
    b->type = 'b';
    b->length = 1;
    st.push(a);
    st.push(b);
    while (n--) {
        string s;
        cin >> s;
        if (s == "copy") {
            st.push(st.top());
        } else if (s == "swap") {
            if (st.size() < 2) {
                crash();
            } else {
                auto y = st.top();
                st.pop();
                auto x = st.top();
                st.pop();
                st.push(y);
                st.push(x);
            }
        } else if (s == "roll") {
            if (st.size() < 3) {
                crash();
            } else {
                auto z = st.top();
                st.pop();
                auto y = st.top();
                st.pop();
                auto x = st.top();
                st.pop();
                st.push(y);
                st.push(z);
                st.push(x);
            }
        } else {
            if (st.size() < 2) {
                crash();
            } else {
                auto y = st.top();
                st.pop();
                auto x = st.top();
                st.pop();
                st.push(merge(x, y));
            }
        }
    }
    if (st.top()->length != s.size()) {
        cout << "NO\n";
    } else {
        cout << (solve() ? "YES" : "NO") << '\n';
    }
    return 0;
}