#include <bits/stdc++.h>

using namespace std;

#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#define per(i, l, r) for (int i = (r - 1); i >= l; --i)
#define ALL(x) (x).begin(), (x).end()

using i64 = long long;

bool test(vector<int> V) {
    set<vector<int>> s;
    s.insert(V);
    queue<vector<int>> que;
    que.push(V);
    const int N = (int)V.size();
    while (not que.empty()) {
        const auto vec = que.front();
        que.pop();

        rep(i, 0, N) {
            auto vec2 = vec;
            if (vec2[i] >= 2) {
                rep(j, 0, vec2[i] - 1) {
                    auto vec3 = vec2;
                    vec3[i] = j;
                    if (s.find(vec3) == s.end()) {
                        s.insert(vec3);
                        que.push(vec3);
                    }
                }
            }
        }
        rep(l, 0, N) {
            rep(r, l + 1, N) {
                auto vec2 = vec;
                bool isOk = true;
                rep(i, l, r + 1) {
                    if (vec2[i] == 0) isOk = false;
                    --vec2[i];
                }
                if (isOk and s.find(vec2) == s.end()) {
                    s.insert(vec2);
                    que.push(vec2);
                }
            }
        }
    }
    vector<int> goal(N, 0);
    return s.find(goal) != s.end();
}

void check() {
    int N = 4;
    mt19937 mt;
    uniform_int_distribution<int> dist(1, 3);
    int tests = 100000;
    while (tests--) {
        vector<int> vec(N);
        rep(i, 1, N - 1) vec[i] = dist(mt);
        if (not test(vec)) {
            for (const auto e : vec) cout << e << ' ';
            cout << endl;
        }
    }
}

void main_() {
    //check();
    //return;
    int N, K;
    cin >> N >> K;
    vector<i64> L(N), R(N);
    rep(i, 0, N) {
        cin >> L[i] >> R[i];
    }
    L.insert(L.begin(), 0);
    R.insert(R.begin(), 0);
    L.push_back(0);
    R.push_back(0);
    N += 2;

    bool ans = true;
    rep(i, 0, N - 2) {
        if (L[i] == 0 and L[i + 1] == 1 and L[i + 2] == 0) ans = false;
    }
    rep(i, 0, N - 3) {
        if (L[i] == 0 and L[i + 1] == 1 and L[i + 2] == 2 and L[i + 3] == 0) ans = false;
        if (L[i] == 0 and L[i + 1] == 2 and L[i + 2] == 1 and L[i + 3] == 0) ans = false;
    }
    rep(i, 0, N - 4) {
        if (L[i] == 0 and L[i + 1] == 2 and L[i + 2] == 1 and L[i + 3] == 2 and L[i + 4] == 0) ans = false;
    }
    cout << (ans ? 1 : 0) << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while (T--) {
        main_();
    }
}