#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) (x1)*(y2)-(x2)*(y1) #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) (x1)*(y2)*(z3)+(x2)*(y3)*(z1)+(x3)*(y1)*(z2)-(z1)*(y2)*(x3)-(z2)*(y3)*(x1)-(z3)*(y1)*(x2) #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = bool; using func = ll; val op(val a, val b) { return a && b; } val e() { return true; } // //val mp(func f, val a) //{ // return (f + a + 26) % 26; //} //func comp(func f, func g) { // return (f + g) % 26; //} // //func id() { // return 0; //} // ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; class BIT { public: BIT(ll s) { size = 1; while (size < s) size *= 2; bit.assign(size, 0); // def unit } void update(ll k, ll var) { k += 1; while (k <= size) { bit[k - 1] += var; // def func k += k & -k; } } ll query(ll a) { ll s = 0; a++; while (a > 0) { s += bit[a - 1]; // def func a -= a & -a; } return s; } ll size; vector bit; }; bool f(val a) { return a; } void solve() { string s, t; cin >> s >> t; BIT sb(s.size()), tb(t.size()); REP(i, s.size()) { if (i) sb.update(i, (s[i] - s[i - 1] + 26) % 26); else sb.update(i, (s[i]-'a') % 26); } REP(i, t.size()) { if (i) tb.update(i, (t[i] - t[i - 1] + 26) % 26); else tb.update(i, (t[i]-'a') % 26); } ll n = min(s.size(), t.size()); segtree st(n); REP(i, n) { ll ss, tt; if (i) { ss = sb.query(i) - sb.query(i - 1); tt = tb.query(i) - tb.query(i - 1); } else { ss = sb.query(i); tt = tb.query(i); } st.set(i, ss == tt); } ll q; cin >> q; while (q--) { ll tt; cin >> tt; if (tt == 1) { ll l, r, x; cin >> l >> r >> x; l--; ll sl = sb.query(l) - sb.query(l - 1); ll tl = tb.query(l) - tb.query(l - 1); ll nsl = (sl + x) % 26; st.set(l, nsl == tl); sb.update(l, nsl - sl); if (r < s.size()) { ll sr = sb.query(r) - sb.query(r - 1); ll tr = tb.query(r) - tb.query(r - 1); ll nsr = (sl + 26 - x) % 26; st.set(r, nsr == tr); sb.update(r, (nsr - sr + 26) % 26); } } else if (tt == 2) { ll l, r, x; cin >> l >> r >> x; l--; ll sl = sb.query(l) - sb.query(l - 1); ll tl = tb.query(l) - tb.query(l - 1); ll ntl = (tl + x) % 26; st.set(l, ntl == tl); tb.update(l, ntl - tl); if (r < s.size()) { ll sr = sb.query(r) - sb.query(r - 1); ll tr = tb.query(r) - tb.query(r - 1); ll ntr = (tl + 26 - x) % 26; st.set(r, ntr == sr); tb.update(r, (ntr - tr + 26) % 26); } } else { ll p; cin >> p; p--; ll id = st.max_right(p); if (id == n) { if (s.size() > n) { cout << "Greater\n"; } else if (t.size() > n) { cout << "Lesser\n"; } else { cout << "Equals\n"; } } else { ll ss = sb.query(id); ll tt = tb.query(id); if (ss < tt) { cout << "Lesser\n"; } else { cout << "Greater\n"; } } } REP(i, s.size()) { cout << sb.query(i) << " "; } cout << endl; REP(i, t.size()) { cout << tb.query(i) << " "; } cout << endl; } } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }