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

#include<atcoder/all>
using namespace atcoder;

#pragma GCC optimzie("O3")
#pragma GCC optimize("unroll-loops")

int op(int x,int y){
	if(x==-2)return y;
	if(y==-2)return x;
	if(x!=y)return -1;
	return x;
}

int e(){
	return -2;
}

int mapping(int f,int x){
	if(x<0)return x;
	return (x+f)%26;
}

int op2(int f,int g){
	return f+g;
}

int id(){
	return 0;
}

signed main(){
	string s,t;cin>>s>>t;
	int ssz=s.size(),tsz=t.size();
	int n=min(ssz,tsz);
	int Q;cin>>Q;
	lazy_segtree<int,op,e,int,mapping,op2,id> seg(n);
	fenwick_tree<int> fs(ssz+1),ft(tsz+1);
	for(int i=0;i<n;i++){
		seg.set(i,(s[i]-t[i]+26)%26);
	}
	
	while(Q--){
		int type;cin>>type;
		if(type==1){
			int l,r,x;cin>>l>>r>>x;l--;
			seg.apply(clamp<int>(l,0,n),clamp<int>(r,0,n),x);
			fs.add(l,x);fs.add(r,-x);
		}
		if(type==2){
			int l,r,x;cin>>l>>r>>x;l--;
			seg.apply(clamp<int>(l,0,n),clamp<int>(r,0,n),26-x);
			ft.add(l,x);ft.add(r,-x);
		}
		if(type==3){
			int l;cin>>l;l--;
			int r=seg.max_right(l,[](int z){return z==0||z==-2;});
			if(r<n){
				int sc=(s[r]-'a'+fs.sum(0,r+1))%26;
				int tc=(t[r]-'a'+ft.sum(0,r+1))%26;
				if(sc>tc)cout<<"Greater"<<endl;
				else if(sc==tc)cout<<"Equals"<<endl;
				else cout<<"Lesser"<<endl;
			}else if(r==ssz&&r==tsz){
				cout<<"Equals"<<endl;
			}else if(r==ssz){
				cout<<"Lesser"<<endl;
			}else if(r==tsz){
				cout<<"Greater"<<endl;
			}
		}
	}
}