#include <iostream>using namespace std;int m, d, t;const int inf = 0x7fffffff;namespace splay{struct node;node *nil = 0, *root;struct node{ ???int val, size, maxnum; ???node *ch[2]; ???node(int v) : val(v), size(1), maxnum(v) ???{ ???????ch[0] = ch[1] = nil; ???} ???void pull_up() ???{ ???????size = ch[0]->size + ch[1]->size + 1; ???????maxnum = max(val, max(ch[0]->maxnum, ch[1]->maxnum)); ???} ???int cmp(int k) ???{ ???????if(this == nil || k == ch[0]->size + 1) ???????????return -1; ???????else ???????????return (k <= ch[0]->size) ? 0 : 1; ???}};void init(){ ???if(!nil) ???????nil = new node(-inf); ???nil->size = 0; ???nil->ch[0] = nil->ch[1] = nil; ???root = new node(-inf); ???root->ch[1] = new node(-inf); ???root->size = 2;}void rotate(node *&t, int d){ ???node *k = t->ch[d ^ 1]; ???t->ch[d ^ 1] = k->ch[d]; ???k->ch[d] = t; ???t->pull_up(); ???k->pull_up(); ???t = k;}void splay(int k, node *&t = root){ ???int d1 = t->cmp(k); ???if(d1 == 1) ???????k = k - t->ch[0]->size - 1; ???if(d1 != -1) ???{ ???????int d2 = t->ch[d1]->cmp(k); ???????if(d2 != -1) ???????{ ???????????int k2 = (d2 == 1) ? (k - t->ch[d1]->ch[0]->size - 1) : k; ???????????splay(k2, t->ch[d1]->ch[d2]); ???????????if(d1 != d2) ???????????{ ???????????????rotate(t->ch[d1], d2 ^ 1); ???????????????rotate(t, d1 ^ 1); ???????????} ???????????else ???????????{ ???????????????rotate(t, d1 ^ 1); ???????????????rotate(t, d2 ^ 1); ???????????} ???????} ???????else ???????????rotate(t, d1 ^ 1); ???}}void insert(int val){ ???splay(root->size - 1); ???node *k = root->ch[1]; ???root->ch[1] = new node(val); ???root->ch[1]->ch[1] = k; ???k->pull_up(); ???root->ch[1]->pull_up(); ???root->pull_up();}int get_maxnum(int len){ ???int from = root->size - len; ???int to = from + len - 1; ???splay(to + 1, root); ???splay(from - 1, root->ch[0]); ???return root->ch[0]->ch[1]->maxnum;}}int main(){ ???using namespace splay; ???cin >> m >> d; ???init(); ???char a; ???int b; ???while(m--) ???{ ???????cin >> a >> b; ???????switch(a) ???????{ ???????case ‘A‘: ???????????insert((b + t) % d); ???????????break; ???????case ‘Q‘: ???????????t = get_maxnum(b); ???????????cout << t << endl; ???????????break; ???????} ???} ???return 0;}