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

#include<atcoder/all>
using namespace atcoder;

#define int long long

using S=array<int,26>;

S op(S x,S y){
	S z;
	for(int i=0;i<26;i++)z[i]=x[i]+y[i];
	return z;
}

S e(){
	return S({});
}

S mapping(int f,S x){
	S rx;
	for(int i=0;i<26;i++)rx[(i+f)%26]=x[i];
	return rx;
}

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<S,op,e,int,mapping,op2,id> seg(n);
	lazy_segtree<int,op2,id,int,op2,op2,id> sseg(ssz),tseg(tsz); 
	for(int i=0;i<n;i++){
		S z{};
		z[(s[i]-t[i]+26)%26]=1;
		seg.set(i,z);
	}
	
	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);
			sseg.apply(l,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);
			tseg.apply(l,r,x);
		}
		if(type==3){
			int l;cin>>l;l--;
			int r=seg.max_right(l,[](S z){return accumulate(z.begin()+1,z.end(),0)==0;});
			if(r<n){
				int sc=(s[r]-'a'+sseg.get(r))%26;
				int tc=(t[r]-'a'+tseg.get(r))%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;
			}
		}
	}
}