#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 400005;
struct vec{
	signed x, y;
	vec(int X = 0, int Y = 0){ x = X, y = Y;}
	bool operator <(vec Y){ return x != Y.x? x < Y.x: y < Y.y;}
} q[N * 2], f[N * 2];
int n, x, y, l, r, la, cnt;
void dec(int &x){ x = x ^ (la & 0x7fffffff);}
char c, tp;
bool cmp(int x1, int y1, int x2, int y2){ return x1 * y2 < x2 * y1;}
struct sgt{
	vector <vec> f[N << 2][2];
	int sz[N << 2];
	void rec(int x){
		for(int o = 0; o < 2; o++){
			f[x][o] = f[x << 1][o];
			for(auto j: f[x << 1 | 1][o]) f[x][o].push_back(j);
			sort(f[x][o].begin(), f[x][o].end());
			int tt = 0;
			for(auto i: f[x][o]){
				while(tt > 1 && cmp(q[tt].y - q[tt - 1].y, q[tt].x - q[tt - 1].x, i.y - q[tt].y, i.x - q[tt].x) == o) tt--;
				q[++tt] = i;
			} f[x][o].clear();
			for(int i = 1; i <= tt; i++) f[x][o].push_back(q[i]);
		}
	}
	int bs(int x, vec k){
		int o = 1; k.x *= -1;
		if(k.y < 0) k.x *= -1, k.y *= -1, o = 0;
		int l = 0, r = f[x][o].size() - 1;
		while(l < r){
			int mid = l + r >> 1;
			if(cmp(f[x][o][mid + 1].y - f[x][o][mid].y, f[x][o][mid + 1].x - f[x][o][mid].x, k.x, k.y) == o) r = mid;
			else l = mid + 1;
		}
		return (1ll * f[x][o][l].x * -k.x + 1ll * f[x][o][l].y * k.y) * (o == 0? -1: 1);
	}
	void mdf(int x, int L, int R, int l, vec k){
		if(L == R) return f[x][0].push_back(k), f[x][1].push_back(k), void();
		int mid = L + R >> 1;
		if(l <= mid) mdf(x << 1, L, mid, l, k);
		else mdf(x << 1 | 1, mid + 1, R, l, k);
		if(++sz[x] == R - L + 1) rec(x);
	}
	int qry(int x, int L, int R, int l, int r, vec k){
		if(L >= l && R <= r) return bs(x, k);
		int mid = L + R >> 1, ans = -1e18;
		if(l <= mid) ans = max(ans, qry(x << 1, L, mid, l, r, k));
		if(r > mid) ans = max(ans, qry(x << 1 | 1, mid + 1, R, l, r, k));
		return ans;
	}
} T;
signed main(){
	ios::sync_with_stdio(0);
	cin >> n >> tp;
	for(int i = 1; i <= n; i++){
		cin >> c >> x >> y;
		if(c == 'A'){
			if(tp != 'E') dec(x), dec(y);
			T.mdf(1, 1, n, ++cnt, vec(x, y));
		} else{
			cin >> l >> r;
			if(tp != 'E') dec(x), dec(y), dec(l), dec(r);
			cout << (la = T.qry(1, 1, n, l, r, vec(x, y))) << '\n';
		}
	}
	return 0;
}