#include <bits/stdc++.h>

using namespace std;

#define vc vector
#define pii pair <int, int>
#define int long long
using ld = long double;
using ll = long long;
const int inf = 1e9;


template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const int mod = 1e8 + 7;
const int N = 1 << 18;

int n, m;
int lg[N];
int F(int x, int y) {
    return m - lg[x ^ y];
}

void solve_case() {
    cin >> m >> n;
    int f = 1;
    vc <int> l(n), r(n);
    for (int i = 0; i < n; ++i) {
        cin >> l[i] >> r[i];
        int x = 1 << lg[l[i] ^ r[i]];
        if (l[i] & (x - 1)) {
            f = 0;
        }
    }
    if (!f) {
        cout << "0\n";
        return;
    }
    vc <vc <int>> dp(n);
    for (int i = l[0]; i <= r[0]; ++i) {
        dp[0].push_back(i % mod);
    }
    for (int k = 1; k < dp[0].size(); ++k) {
        dp[0][k] = (dp[0][k - 1] + dp[0][k]) % mod;
    }
    for (int i = 1; i < n; ++i) {
        for (int j = l[i]; j <= r[i]; ++j) {
            dp[i].push_back(0);
            int kl = l[i - 1] - 1, kr = r[i - 1] + 1;
            while (kr - kl > 1) {
                int k = (kl + kr) / 2;
                if (F(k, r[i - 1]) >= F(j, r[i - 1])) {
                    kr = k;
                } else {
                    kl = k;
                }
            }
            int l1 = kr;
            kl = l[i - 1] - 1, kr = r[i - 1] + 1;
            while (kr - kl > 1) {
                int k = (kl + kr) / 2;
                if (F(j, l[i]) >= F(k, l[i])) {
                    kl = k;
                } else {
                    kr = k;
                }
            }
            int r1 = kl;
            if (l1 <= r1) {
                int sr1 = dp[i - 1][r1 - l[i - 1]];
                if (l1 >= l[i - 1] + 1)
                    sr1 = ((sr1 - dp[i - 1][l1 - l[i - 1] - 1]) % mod + mod) % mod;
                dp[i].back() = sr1 * j % mod;
            }
        }
        for (int k = 1; k < dp[i].size(); ++k) {
            dp[i][k] = (dp[i][k - 1] + dp[i][k]) % mod;
        }
    }
    int ans = dp[n - 1].back();
    cout << ans << '\n';
}

signed main() {
    for (int i = 2; i < N; ++i) {
        lg[i] = lg[i >> 1] + 1;
    }
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) solve_case();
}