#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

const int N = 6001;

int testcase;

map<int, int> p[N];

inline void work() {
    printf("Case #%d:\n", ++testcase);
    rep(i, 1, N - 1) p[i].clear();
    int n = rd(), m = rd();
    ll lstans = 0;
    rep(i, 1, n) {
        int x = rd(), y = rd(), w = rd();
        p[x][y] = w;
    }
    rep(i, 1, m) {
        int op = rd();
        int x = (rd() + lstans) % 6000 + 1;
        int y = (rd() + lstans) % 6000 + 1;
        if (op == 1) p[x][y] = rd();
        else if (op == 2) p[x].erase(p[x].find(y));
        else if (op == 3) {
            int k = rd(), w = rd();
            int r = sqrt(k), h = 0;
            rep(xx, max(1, x - r), min(6000, x + r)) {
                int dx = abs(x - xx);
                while (dx * dx + h * h <= k) ++h;
                while (dx * dx + h * h > k) --h;
                if (dx * dx + h * h == k) {
                    int yy = y + h;
                    if (p[xx].find(yy) != p[xx].end()) p[xx][yy] += w;
                    if (h != 0){
                        yy = y - h;
                        if (p[xx].find(yy) != p[xx].end()) p[xx][yy] += w;
                    }
                }
            }
        } else {
            int k = rd();
            ll ans = 0;
            int r = sqrt(k), h = 0;
            rep(xx, max(1, x - r), min(6000, x + r)) {
                int dx = abs(x - xx);
                while (dx * dx + h * h <= k) ++h;
                while (dx * dx + h * h > k) --h;
                if (dx * dx + h * h == k) {
                    int yy = y + h;
                    if (p[xx].find(yy) != p[xx].end()) ans += p[xx][yy];
                    if (h != 0){
                        yy = y - h;
                        if (p[xx].find(yy) != p[xx].end()) ans += p[xx][yy];
                    }
                }
            }
            printf("%lld\n", lstans = ans);
        }
    }
}

int main() {
    per(t, rd(), 1) work();
    return 0;
}