#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <cstdio>
#include <cmath>
const int N=20200;
using namespace std;

int c[N],n,m,t,T;
int shield[N],pos[N];

struct node
{
  int l,r;
}attack[N];

int lowbit(int x)
{
    return x&(-x);
}

void update(int x,int d)
{
  while(x<=n)
  {
    c[x]+=d;
    x+=lowbit(x);
  }
}

int getsum(int x)
{
  int ans=0;
  while(x>0)
  {
    ans+=c[x];
    x-=lowbit(x);
  }
  return ans;
}

void Init()
{
   scanf("%d%d%d",&n,&m,&t);
   memset(c,0,sizeof(c));
   memset(shield,0,sizeof(shield));
   memset(pos,0,sizeof(pos));
}

int main()
{
        char s[10];
        int test=1;
        scanf("%d",&T);
        while(T--)
        {

         Init();
         int cnt=0;
         printf("Case %d:\n",test++);
         while(m--)
         {
            scanf("%s",s);
            if(s[0]==‘A‘)
            {
             cnt++;
             int si,ti;
             scanf("%d%d",&si,&ti);
             attack[cnt].l=si;
             attack[cnt].r=ti;
             update(si,1);
             update(ti+1,-1);
            }
            else
            {
             int a;
             scanf("%d",&a);
             for(int i=pos[a];i<=cnt;)
             {
               if(a>=attack[i].l&&a<=attack[i].r)
               {
                 pos[a]=i+t;
                 shield[a]++;
                 i=i+t;
               }
               else i++;
             }
             printf("%d\n",getsum(a)-shield[a]);
            }
         }

        }
        return 0;
}