#include <bits/stdc++.h>
using namespace std;

int T, n, q;
map<pair<int, int>, int> mp, crit;
vector<pair<int, int>> cand;

int main() {
    scanf("%d", &T);
    function<int(int, int)> solve = [&](int l, int r) {
        auto it = lower_bound(cand.begin(), cand.end(), make_pair(l + r, l));
        if (it == cand.end() || it->first != l + r) return (r - l) & 1;
        l = it->second, r = it->first - l;
        if (crit.count({l, r})) return crit[{l, r}];
        if (l == r) return 0;
        if (mp.count({l, r})) return mp[{l, r}];
        return mp[{l, r}] = !solve(l + 1, r) | !solve(l, r - 1);
    };
    while (T--) {
        scanf("%d %d", &n, &q);
        mp.clear(), crit.clear(), cand.clear();
        while (n--) {
            int l, r, z;
            scanf("%d %d %d", &l, &r, &z);
            crit[{l, r}] = z;
            for (int i = l - 2; i <= l; i++) {
                for (int j = r; j <= r + 2; j++) {
                    if (j - i <= r - l + 2) cand.emplace_back(i + j, i);
                }
            }
        }
        sort(cand.begin(), cand.end());
        while (q--) {
            int l, r;
            scanf("%d %d", &l, &r);
            putchar(solve(l, r) ? '1' : '0');
        }
        putchar('\n');
    }
    return 0;
}