// Problem: 最大数
// Contest: AcWing
// URL: https://www.acwing.com/problem/content/1277/
// Memory Limit: 64 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

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

typedef long long ll;

struct Segment
{
    int l, r, v;
};

const int N = 8e5 + 10;
Segment tr[N];

void pushup(int u) // 更新第u个节点的信息
{
    tr[u].v = max(tr[u << 1].v, tr[u << 1 | 1].v);
}

void build(int u, int l, int r) // 将区间[l,r]初始化为线段树
{
    tr[u] = {l, r};

    if (l == r) return;

    int mid = l + r >> 1;

    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
}

int query(int u, int l, int r) // 查询区间[l,r]的信息
{
    if (tr[u].l >= l && tr[u].r <= r) return tr[u].v;

    int mid = tr[u].l + tr[u].r >> 1;

    int v = 0;

    if (l <= mid) v = max(v, query(u << 1, l, r));
    if (r > mid) v = max(v, query(u << 1 | 1, l, r));

    return v;
}

void modify(int u, int x, int v) // 修改某个节点的信息
{
    if (tr[u].l == x && tr[u].r == x)
    {
        tr[u].v = v;
        return;
    }

    int mid = tr[u].l + tr[u].r >> 1;

    if (x <= mid) modify(u << 1, x, v);
    else modify(u << 1 | 1, x, v);

    pushup(u);
}

int main()
{
    int m, n;
    cin >> m >> n;

    build(1, 1, m);

    char op;
    int k, a = 0, p = 0;
    while (m--)
    {
        cin >> op >> k;

        if (op == 'A')
            modify(1, ++p, ((ll)a + k) % n);
        else
        {
            a = query(1, p - k + 1, p);

            cout << a << '\n';
        }
    }


    return 0;
}