#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set> 
#define int long long
#define ll long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=2e5+5;
inline int read()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+(c-'0');
		c=getchar();
	}
	return x*f;
}
int T;
vector<pii> pw[20000005];
int p[6050][6050];
vector<pii> st;
set<pii> s;
bool check(int x,int y)
{
    return x>0&&y>0&&x<=6000&&y<=6000;
}
signed main()
{
    for(ll i=1;i*i<=10000000;i++)
    {
        ll x=i*i;
        pw[x].push_back({i,0});
        for(ll j=1;j<=i&&j*j+i*i<=10000000;j++) pw[i*i+j*j].push_back({i,j});
    }
    pw[0].push_back({0,0});
	T=read();
    rep(P,1,T)
    {
        printf("Case #%lld:\n",P);
        int n=read(),m=read();
        rep(i,1,n)
        {
            int x=read(),y=read(),w=read();
            p[x][y]+=w;
            st.push_back({x,y});
        }
        int lastans=0;
        rep(i,1,m)
        {
            int opt=read();
            int x=(read()+lastans)%6000+1,y=(read()+lastans)%6000+1;
            // printf("%lld %lld\n",x,y);
            if(opt==1)
            {
                int w=read();
                p[x][y]=w;
                st.push_back({x,y});
            }
            else if(opt==2) p[x][y]=0;
            else if(opt==3)
            {
                int k=read(),w=read();
                for(pii u:pw[k])
                {
                    int px=u.first,py=u.second;
                    if(check(x+px,y+py)&&p[x+px][y+py]) s.insert({x+px,y+py}); 
                    if(check(x+px,y-py)&&p[x+px][y-py]) s.insert({x+px,y-py}); 
                    if(check(x-px,y+py)&&p[x-px][y+py]) s.insert({x-px,y+py}); 
                    if(check(x-px,y-py)&&p[x-px][y-py]) s.insert({x-px,y-py});  
                    if(px==py) continue;
                    swap(px,py);
                    if(check(x+px,y+py)&&p[x+px][y+py]) s.insert({x+px,y+py}); 
                    if(check(x+px,y-py)&&p[x+px][y-py]) s.insert({x+px,y-py});  
                    if(check(x-px,y+py)&&p[x-px][y+py]) s.insert({x-px,y+py}); 
                    if(check(x-px,y-py)&&p[x-px][y-py]) s.insert({x-px,y-py}); 
                }
                for(auto u:s) p[u.first][u.second]+=w;
                s.clear();
            }
            else
            {
                int ans=0;
                int k=read();
                for(pii u:pw[k])
                {
                    int px=u.first,py=u.second;
                    if(check(x+px,y+py)&&p[x+px][y+py]) s.insert({x+px,y+py}); 
                    if(check(x+px,y-py)&&p[x+px][y-py]) s.insert({x+px,y-py}); 
                    if(check(x-px,y+py)&&p[x-px][y+py]) s.insert({x-px,y+py}); 
                    if(check(x-px,y-py)&&p[x-px][y-py]) s.insert({x-px,y-py});  
                    if(px==py) continue;
                    swap(px,py);
                    if(check(x+px,y+py)&&p[x+px][y+py]) s.insert({x+px,y+py}); 
                    if(check(x+px,y-py)&&p[x+px][y-py]) s.insert({x+px,y-py});  
                    if(check(x-px,y+py)&&p[x-px][y+py]) s.insert({x-px,y+py}); 
                    if(check(x-px,y-py)&&p[x-px][y-py]) s.insert({x-px,y-py}); 
                }
                for(pii u:s) ans+=p[u.first][u.second];
                printf("%lld\n",lastans=ans);
                s.clear();
            }
        }
        for(auto x:st) p[x.first][x.second]=0;
        st.clear(); 
    }
}