#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}

#include <atcoder/lazysegtree>
const int D = 26;
struct lazy_S {
    int size = -1;
    int a = 0;
    int b = 0;
    int diff = -1;
};

using lazy_F = pair<int, int>;

lazy_S lazy_op(lazy_S l, lazy_S r) {
    if (l.size == -1) return r;
    if (r.size == -1) return l;
    if (l.diff != r.diff) l.diff = -1;
    return l;
}

lazy_S lazy_e() { return lazy_S{}; }

lazy_S mapping(lazy_F l, lazy_S r) {
    r.a = (r.a + l.first) % D;
    r.b = (r.b + l.second) % D;
    if (r.diff != -1) r.diff = (r.a - r.b + D) % D;
    return r;
}

//l(r(x))
lazy_F composition(lazy_F l, lazy_F r) {
    l.second += r.second;
    l.first += r.first;
    return l;
}

lazy_F lazy_id(){return {0, 0};}

#define lazy_calc lazy_S,lazy_op,lazy_e,lazy_F,mapping,composition,lazy_id

bool f(lazy_S x){
    return x.size == -1 || x.diff == 0;
};

void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    string S, T;
    cin >> S >> T;
    int N = S.size(), M = T.size();
    vector<lazy_S> base(max(N, M));
    rep(i, 0, max(N, M)){
        base[i].size = 1;
        if (i < min(N, M)){
            base[i].a = S[i] - 'a';
            base[i].b = T[i] - 'a';
            base[i].diff = (base[i].a - base[i].b + D) % D;
        }
    }
    atcoder::lazy_segtree<lazy_calc> seg(base);
    int Q;
    cin >> Q;
    while (Q--){
        int t;
        cin >> t;
        if (t == 3){
            int p;
            cin >> p;
            p--;
            int b = seg.max_right<f>(p);
            int ans = 0;
            if (b == min(N, M)){
                if (b != N){
                    ans = 1;
                }
                if (b != M){
                    ans = -1;
                }
            }
            else{
                auto tmp = seg.get(b);
                if (tmp.a < tmp.b) ans = -1;
                else ans = 1;
            }
            cout << (ans == 1 ? "Greater\n" : ans == -1 ? "Lesser\n" : "Equals\n");
        }
        else{
            int l, r, x;
            cin >> l >> r >> x;
            l--;
            lazy_F tmp;
            if (t == 1) tmp.first = x;
            else tmp.second = x;
            seg.apply(l, r, tmp);
        }
    }
}