#include <bits/stdc++.h>
#include <atcoder/lazysegtree>
#include <atcoder/fenwicktree>

using namespace std;
using namespace atcoder;

const int sigma = 26;
const int emptyset = -1;
const int wildcard = 9999;

int op(int x, int y) {
    if (x == emptyset || y == emptyset) {
        return emptyset;
    } else if (x == wildcard) {
        return y;
    } else if (y == wildcard) {
        return x;
    } else if (x == y){
        return x;
    } else {
        return emptyset;
    }
}

int e() { return wildcard; }

int mapping(int f, int x) {
    if (x == emptyset || x == wildcard) {
        return x;
    } else {
        return (f + x) % sigma;
    }
}

int composition(int f, int g) { return (f + g) % sigma; }
int id_() { return 0; }

int main() {
    string s, t;
    cin >> s >> t;

    int min_s_t = min(s.size(), t.size());

    vector<int> diff(min_s_t);
    for (int i = 0; i < min_s_t; i++) {
        diff[i] = (s[i] - t[i] + sigma) % sigma;
    }

    lazy_segtree<int, op, e, int, mapping, composition, id_> seg(diff);

    fenwick_tree<int> s_imos(s.size() + 1);
    fenwick_tree<int> t_imos(t.size() + 1);

    int q;
    cin >> q;

    while (q--) {
        int cmd;
        cin >> cmd;

        if (cmd == 1) {
            int l, r, x;
            cin >> l >> r >> x;

            seg.apply(min(l - 1, min_s_t), min(r, min_s_t), x);
            s_imos.add(l - 1, x);
            s_imos.add(r, sigma - x);

        } else if (cmd == 2) {
            int l, r, x;
            cin >> l >> r >> x;

            seg.apply(min(l - 1, min_s_t), min(r, min_s_t), sigma - x);
            t_imos.add(l - 1, x);
            t_imos.add(r, sigma - x);

        } else {
            int p;
            cin >> p;

            int idx = seg.max_right(p - 1, [&](int v) { return (v == 0 || v == wildcard); });

            if (idx < min_s_t) {
                int s_val = (int)(s_imos.sum(0, idx + 1) + s[idx] - 'a') % sigma;
                int t_val = (int)(t_imos.sum(0, idx + 1) + t[idx] - 'a') % sigma;

                if (s_val > t_val) {
                    cout << "Greater" << endl;
                } else {
                    cout << "Lesser" << endl;
                }

            } else {
                if (s.size() > t.size()) {
                    cout << "Greater" << endl;
                } else if (s.size() < t.size()) {
                    cout << "Lesser" << endl;
                } else {
                    cout << "Equals" << endl;
                }
            }
        }
    }
}