^^

#include<bits/stdc++.h>

#define nl "\n"
#define fi first
#define se second
#define pi 3.14159
#define ll long long
#define odd(a)  (a&1)
#define even(a)  !(a&1)
#define Mod 1'000'000'007
#define INF 2'000'000'000 // 2e9
#define sz(x) int(x.size())
#define charToInt(s) (s - '0')
#define ull unsigned long long
#define number_line iota(all(vec) , 1)
#define all(s) s.begin(), s.end()
#define rall(v) v.rbegin() , v.rend()
#define fixed(n) fixed << setprecision(n)
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define to_decimal(bin) stoll(bin, nullptr, 2)
#define Ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define Floor(n, m) (((n) / (m)) - ((n) % (m) ? 0 : 1))
#define Upper(s) transform(all(s), s.begin(), ::toupper);
#define Lower(s) transform(all(s), s.begin(), ::tolower);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
//  ----- bits-------
#define pcnt(n) __builtin_popcount(n)
#define pcntll(n) __builtin_popcountll(n)
#define clz(n) __builtin_clz(n)    // <---100
#define clzll(n) __builtin_clzll(n)
#define ctz(n) __builtin_ctz(n)  // 0001---->
#define ctzll(n) __builtin_ctzll(n)

using namespace std;

template<typename T = int>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v) in >> x;
    return in;
}

template<typename T = int>
ostream &operator<<(ostream &out, const vector<T> &v) {
    for (const T &x: v) out << x << " ";
    return out;
}

void esraa() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}



void solve() {
    string s;
    cin >> s;
    vector < vector < int > > idx(26);
    for(int i = 0 ; i < sz(s) ; i++){
        idx[s[i]].push_back(i);
    }
    for(int i = 0 ; i < 26 ; i++){
        sort(all(idx[i]));
    }
    int q;
    cin >> q;
    string t = "";
    ll last_valid = 0  , cnt_no = 0;
    deque < int > last;
    while(q--){
        string x;
        cin >> x;
        bool ok = true;
        if(x == "push"){
            char c;
            cin >> c;
            t += c;
//            cout << t << nl;
            if(sz(t) == 0) cout << "YES" << nl;
            else if(sz(t) == 1){
                if(sz(idx[c]) == 0 or cnt_no > 0) cout << "NO" << nl , ok = false , cnt_no++;
                else cout << "YES" << nl , last.push_back(idx[c][0]);
            }
            else{
                if(cnt_no > 0) cout << "NO" << nl , cnt_no++;
                else{
                    if(last.empty()) last.push_back(-1);
                    auto it = upper_bound(all(idx[c]) , last.back());
//                    cout << *it << nl;
//                    cout << last.back() << " " << c << nl;
                    if(it == idx[c].end()){
                        cnt_no++;
                        cout << "NO" << nl;
                        last.push_back(INF);
                    }else cout << "YES" << nl , last.push_back(*it);
//                    cout << last.back() << nl;
                }

            }
        }else{
//            cout << cnt_no << nl;
            if(cnt_no > 0)  cnt_no--;
            if(cnt_no > 0) cout << "NO" << nl , cnt_no++;
            else cout << "YES" << nl;
            t.pop_back();
//            cout << last.back() << " " << " pop" << nl;
            last.pop_back();
        }
    }
//    for(int i = 0 ; i < sz(s) ; i++){
//        for(auto & c : idx[s[i]]) cout << c << " ";
//        cout << nl;
//    }








}

int main() {
    esraa();
    int t = 1;
//     cin >> t;
    //cin.ignore();
    while (t--)
        solve();
    return 0;
}