#include <bits/stdc++.h>

using namespace std;

typedef long long ll ;


const ll MAX = 100009 ;
ll tree[5*MAX] = {0};
ll lazy[5*MAX] = {0};

void update(ll node , ll left , ll right , ll from , ll to , ll val)
{
    if(lazy[node] != 0)
    {
        tree[node] += (right-left+1) * lazy[node];
        if (left != right)
        {
            lazy[2*node] += lazy[node];
            lazy[2*node+1] += lazy[node];
        }
        lazy[node] = 0;
    }

    if (left > right || left > to || right < from)
        return ;

    if(left >= from && right <= to)
    {
        tree[node] += (right-left+1)*val;

        if(left != right)
        {
            lazy[2*node] += val ;
            lazy[2*node+1] += val ;
        }
        return ;
    }
    ll mid = (left + right) >> 1 ;
    update(node*2 , left , mid , from , to , val);
    update(2*node+1,mid+1,right,from,to,val);
    tree[node] = tree[2*node] + tree[2*node+1];
}

ll query(ll node , ll left, ll right, ll from, ll to)
{
    if(lazy[node] != 0)
    {
        tree[node] += (right - left + 1) * lazy[node];
        if(left != right)
        {
            lazy[2*node] += lazy[node];
            lazy[2*node+1] += lazy[node];
        }
        lazy[node] = 0 ;
    }
    if(left > right || left > to || right < from)
        return 0 ;

    if(left >= from && right <= to)
        return tree[node];

    ll mid = (left + right) >> 1 ;
    return query(2*node , left , mid , from , to) +
           query(2*node+1,mid+1,right,from,to);
}

int main()
{
    ll t ;
    scanf("%lld" , &t);
    ll cnt = 0;
    while(t--)
    {
        for(int i = 0 ; i < 5*MAX ; ++i)
            lazy[i] = tree[i] = 0 ;
        ll n , q ;
        scanf("%lld %lld" , &n , &q);
        ll arr[100005] = {0};
        printf("Scenario #%lld:\n",++cnt);
        while(q--)
        {
            char s[15];
            ll x ,y ;
            scanf("%s",&s);
            scanf("%lld %lld" , &x , &y);
            if(x > y)
               printf("0\n");
            else if(s[0] == 'a')
               printf("%lld\n",query(1,0,n-1,x-1,y-1));
            else
            {
                update(1,0,n-1,x-1,y-1,1);
                printf("OK\n");
            }
        }
    }
     return 0 ;
}