#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
void solve()
{
    int n, k;
    cin >> n >> k;
    vector<set<pair<int, int> > > s(n + 2);
    for(int i = 0; i < k; i++)
    {
        int l, r;
        cin >> l >> r;
        s[l].insert({r, 0});
    }
    int db = k;
    for(int i = 1; i <= n; i++)
    {
        for(auto it = s[i].begin(); it != s[i].end(); it++)
        {
            int x = it -> first, type = it -> second;
            auto nxt = it;
            nxt++;
            if(nxt == s[i].end()) break;
            int n_x = nxt -> first, n_type = nxt -> second;
            if(x == n_x)
            {
                if((type == 0 && n_type == 1) || (type == 1 && n_type == 2))
                {
                    cout << "0\n";
                    return;
                }
                if(type == 0 && n_type == 2)
                {
                    db--;
                }
            }
            else
            {
                if(type > n_type) swap(type, n_type);
                if((type == 0 && n_type == 2) || (type == 0 && n_type == 0) || (type == 2 && n_type == 2))
                {
                    s[x + 1].insert({n_x, 1});
                }
                if(type == 1 && n_type == 1)
                {
                    s[x + 1].insert({n_x, 1});
                }
                if((type == 0 && n_type == 1) || (type == 1 && n_type == 2))
                {
                    s[x + 1].insert({n_x, 2});
                }
            }
        }
    }
    int ans = 1;
    for(int i = 0; i < n - db; i++)
    {
        ans <<= 1;
        ans %= MOD;
    }
    cout << ans << "\n";
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--) solve();
}