#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<set>
#include<stack>
#include<deque>
#include<bitset>
#include<unordered_map>
#include<unordered_set>
#include<queue>
#include<cstdlib>
#include<ctype.h>
#include<ctime>
#include<functional>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define debug puts("debug")
#define mid ((L+R)>>1)
#define lc (id<<1)
#define rc (id<<1|1)
const int maxn=10010;
const int maxm=50050;
const double PI=acos(-1.0);
const double eps=1e-6;
const LL mod=1e9+7;
LL gcd(LL a,LL b){return b==0?a:gcd(b,a%b);}
LL lcm(LL a,LL b){return a/gcd(a,b)*b;}
LL qpow(LL a,LL b,LL c){LL r=1; for(;b;b>>=1,a=a*a%c)if(b&1)r=r*a%c;return r;}
struct Edge{int v,w,next;};

template<class T>
ostream & operator<<(ostream &out,vector<T>&v){
    for(auto x:v)cout<<x<<' ';
    return out;
}
void read(LL &n){
    n=0; char c=getchar();
    while(c<'0'||c>'9')c=getchar();
    while(c>='0'&&c<='9') n=(n<<3)+(n<<1)+(c-'0'),c=getchar();
}
LL C[6005][6005];
LL dir[4][2]={1,1,1,-1,-1,1,-1,-1};
bool ojbk(LL x,LL y){
    if(x<1||x>6000||y<1||y>6000||C[x][y]==0)return 0;
    return 1;
}
#define pll pair<LL,LL>
const LL MAX=10000000+15;
vector<pll> cl,a[MAX];
void AC(){
    LL T,n,m,cas=0;
    scanf("%lld",&T);
    while(T--){
        scanf("%lld%lld",&n,&m);
        LL last=0;
        LL x,y,w,k,op;
        for(int i=1;i<=n;++i){
            scanf("%lld%lld%lld",&x,&y,&w);
            cl.pb(mp(x,y));
            C[x][y]+=w;
        }
        printf("Case #%lld:\n",++cas);
        while(m--){
            scanf("%lld%lld%lld",&op,&x,&y);
            x=(x+last)%6000+1;
            y=(y+last)%6000+1;cl.pb(mp(x,y));
            if(op==1){
                scanf("%lld",&w);
                C[x][y]=w;

            }
            else if(op==2){
                C[x][y]=0;
            }
            else if(op==3){
                scanf("%lld%lld",&k,&w);
                set<pll>S;
                for(auto v:a[k]){
                    for(int i=0;i<4;++i){
                        LL sx=x+v.fi*dir[i][0],sy=y+v.se*dir[i][1];
                        if(ojbk(sx,sy))S.insert(mp(sx,sy));
                    }

                }for(auto o:S){
                        C[o.fi][o.se]+=w;
                    }
            }
            else{
                scanf("%lld",&k);
                LL ans=0;
                set<pll>S;
                for(auto v:a[k]){

                    for(int i=0;i<4;++i){
                    LL sx=x+v.fi*dir[i][0],sy=y+v.se*dir[i][1];
                        if(ojbk(sx,sy))S.insert(mp(sx,sy));
                    }

                }for(auto o:S){
                        ans+=C[o.fi][o.se];
                    }
                printf("%lld\n",ans);
                last=ans;
            }
        }
        for(auto v:cl)C[v.fi][v.se]=0;
        cl.clear();
    }
}
int main(){
    for(LL i=0;i<=6000;++i){
        for(LL j=0;j<=6000;++j){
            if(i*i+j*j>MAX-15)break;
            a[i*i+j*j].pb(mp(i,j));
        }
    }
    AC();
    return 0;
}
/*

1
3 6
2999 3000 1
3001 3000 1
3000 2999 1
1 2999 3000 1
4 2999 2999 1
2 2995 2996
3 2995 2995 1 1
4 2995 2995 1
4 3000 3000 1

*/