#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pp pair<ll,ll>
using namespace std;

ll n;
vector<ll> bit;
void update(ll ind,ll incr)
{
	while(ind<=n)
	{
		bit[ind]+=incr;
		ind+=(ind&(-ind));
	}
}

ll query(ll ind)
{
	ll ans=0;
	while(ind>=1)
	{
		ans+=bit[ind];
		ind-=(ind&(-ind));
	}
	return ans;
}

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll t;
  cin>>t;
  while(t--)
  {
  	ll nn,m;
  	cin>>nn>>m;
  	n=nn*nn*nn;
  	vector<ll>ar(n+1);
  	vector<ll>br(n+1);
  	bit=br;

  	for(ll i=0;i<m;i++)
  	{
  		string s;
  		cin>>s;
  		if(s=="UPDATE")
  		{
 			ll x,y,z;ll w;
 			cin>>x>>y>>z>>w;
 			ll add=1+(x-1)*nn*nn+(y-1)*nn+(z-1);
 			update(add,w);
 			
  		}
  		else
  		{
  			ll x1,y1,z1,x2,y2,z2;
  			cin>>x1>>y1>>z1>>x2>>y2>>z2;
 			ll add1=1+(x1-1)*nn*nn+(y1-1)*nn+(z1-1);
 			ll add2=1+(x2-1)*nn*nn+(y2-1)*nn+(z2-1);
 			ll ans=0;
 		    ans=query(add2)-query(add1-1);
 			cout<<ans<<endl;
  		}
  	}



  }
}