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

using namespace std;
using namespace atcoder;

int sigma = 26;

int op(int x, int y) { return x & y; }
int e() { return (1 << sigma) - 1; }
int mapping(int f, int x) { return ((x << f) & ((1 << sigma) - 1)) | (x >> (sigma - f)); }
int composition(int f, int g) { return (f + g) % sigma; }
int id_() { return 0; }

int op_imos(int x, int y) { return (x + y) % sigma; }
int e_imos() { return 0; }

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

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

    vector<int> diff(min_st);
    for (int i = 0; i < min(s.size(), t.size()); i++) {
        diff[i] = 1 << ((s[i] - t[i] + sigma) % sigma);
    }

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

    segtree<int, op_imos, e_imos> s_imos(s.size() + 1);
    segtree<int, op_imos, e_imos> 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_st), min(r, min_st), x);
            s_imos.set(l - 1, (s_imos.get(l - 1) + x) % sigma);
            s_imos.set(r, (s_imos.get(r) - x + sigma) % sigma);

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

            seg.apply(min(l - 1, min_st), min(r, min_st), sigma - x);
            t_imos.set(l - 1, (t_imos.get(l - 1) + x) % sigma);
            t_imos.set(r, (t_imos.get(r) - x + sigma) % sigma);

        } else {
            int p;
            cin >> p;

            int idx = seg.max_right(p - 1, [&](int x) { return x & 1 == 1; });

            if (idx < min_st) {
                int s_val = (int)(s_imos.prod(0, idx + 1) + s[idx] - 'a') % sigma;
                int t_val = (int)(t_imos.prod(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;
                }
            }
        }
    }
}