//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n,q;
map<int,vector<int>> vec;
map<pii,int> Mp,Rem;
int dfs(int l,int r)
{
	int val=l+r;
	int pos=0;
	if(vec.count(val))
		pos=ub(vec[val],r-l);
	int diff;
	if(pos)
		diff=vec[val][pos-1];
	else
		diff=val%2;
	l=(val-diff)/2;
	r=(val+diff)/2;
	if(Mp.count(pii(l,r))) return Mp[pii(l,r)];
	if(Rem.count(pii(l,r))) return Rem[pii(l,r)];
	if(l==r) return 0;
	if(!dfs(l+1,r)||!dfs(l,r-1)) return Rem[pii(l,r)]=1;
	return Rem[pii(l,r)]=0;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n>>q;
		Mp.clear();
		vec.clear();
		Rem.clear();
		for(int i=1;i<=n;i++)
		{
			int l,r,v;
			cin>>l>>r>>v;
			Mp[pii(l,r)]=v;
			for(int a=0;a<=4;a++)
				for(int b=0;a+b<=4;b++)
					vec[l+r-a+b].pb(r-l+a+b);
		}
		for(auto &pr:vec)
			srt(pr.second);
		while(q--)
		{
			int l,r;
			cin>>l>>r;
			cout<<dfs(l,r);
		}
		cout<<'\n';
	}
	return 0;
}