#include<bits/stdc++.h>
using namespace std;
#define lid (id << 1)
#define rid (id << 1 | 1)
#define ll long long
const int N = 2e5+5;
struct node{
	int l, r;
	ll mx;
}tr[N << 2];
int n, d, cnt;
ll last;
void pushup(int id){
	tr[id].mx = max(tr[lid].mx, tr[rid].mx);
}
void build(int id, int l, int r){
	tr[id].l = l;
	tr[id].r = r;
	tr[id].mx = 0;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(lid, l, mid);
	build(rid, mid + 1, r);
}
void add(int id, int pos, ll k){
	if (tr[id].l == tr[id].r){
		tr[id].mx = k;
		return;
	}
	int mid = (tr[id].l + tr[id].r) >> 1;
	if (pos <= mid) add(lid, pos, k);
	else add(rid, pos, k);
	pushup(id);
}
ll query(int id, int l, int r){
	if (l <= tr[id].l && tr[id].r <= r) return tr[id].mx;
	int mid = (tr[id].l + tr[id].r) >> 1;
	if (r <= mid) return query(lid, l, r);
	else if (l > mid) return query(rid, l, r);
	else max(query(lid, l, mid), query(rid, mid + 1, r));
}
int main(){
	cin >> n >> d;
	build(1, 1, 200000);
	while (n--){
		char op;
		ll x;
		cin >> op >> x;
		if (op == 'Q'){
			if (!x) last = 0;
			else last = query(1, cnt - x + 1, cnt);
			cout << last << '\n';
		}
		else{
			x += last;
			x %= d;
			++cnt;
			add(1, cnt, x);
		}
		//cout << cnt << '\n';
	}
	return 0;
}