#include<bits/stdc++.h>
#define int long long
using namespace std;
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define eb emplace_back
#define y1 yylyylyylyyl
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef __int128 lll;
 
long long read() {
    long long res=0, w=1; char c=getchar();
    while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
    while(isdigit(c)) {res=res*10+c-48, c=getchar();}
    return res*w;
}

const int N=1e6+9;
int n,q,l[N],r[N],z[N],ans[N];
map<pii,int>g;
map<int,int>f;

int calc(int l,int r) {
    if(g.count(pii(l,r))) return f[l+r]=g[pii(l,r)];
    else {
        if(!f.count(l+r-1)) f[l+r-1]=(l+r-1)%2;
        if(!f.count(l+r+1)) f[l+r+1]=(l+r+1)%2;
        int x=f[l+r-1], y=f[l+r+1];
        f[l+r]=!(x&&y);
        return f[l+r];
    }
}

int tk;
struct key {int l,r,id;} k[N*10];
bool cmp(const key &x,const key &y) {
    return x.r-x.l==y.r-y.l?x.id<y.id:x.r-x.l<y.r-y.l;
}
void add(int l,int r,int id) {
    if(l>r) return;
    k[++tk]=(key){l,r,id};
}

signed main() {
    int T=read();
    while(T--) {
        g.clear(), f.clear(), tk=0;
        n=read(), q=read();
        rep(i,1,n) l[i]=read(), r[i]=read(), z[i]=read();
        rep(i,1,n) {
            add(l[i]-2,r[i],0), add(l[i]-1,r[i],0),
            add(l[i],r[i]+2,0), add(l[i],r[i]+1,0),
            add(l[i],r[i],0), add(l[i]-1,r[i]+1,0);
            g[pii(l[i],r[i])]=z[i];
        }
        rep(i,1,q) {
            int a=read(), b=read();
            add(a,b,i);
        }
        sort(k+1,k+tk+1,cmp);
        rep(i,1,tk) {
            int l=k[i].l, r=k[i].r, id=k[i].id;
            ans[id]=calc(l,r);
        }
        rep(i,1,q) putchar('0'+ans[i]);
        putchar('\n');
    }
    return 0;
}