#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2000000 + 5;
const int P = 1000000007;

int fac[MAX_N], ifac[MAX_N];

int power_mod(int a, int b) {
    int c = 1;
    for (; b; b >>= 1) {
        if (b & 1) c = 1ll * c * a % P;
        a = 1ll * a * a % P;
    }
    return c;
}
void init(int N) {
    fac[0] = 1;
    for (int i = 1; i <= N; i ++) {
        fac[i] = 1ll * fac[i - 1] * i % P;
    }
    ifac[N] = power_mod(fac[N], P - 2);
    for (int i = N; i >= 1; i --) {
        ifac[i - 1] = 1ll * ifac[i] * i % P;
    }
}

int get_c(int n, int m) {
    if (m < 0 || m > n || n < 0) return 0;
    return 1ll * fac[n] * ifac[m] % P * ifac[n - m] % P;
}
int get_a(int n, int m) {
    if (m < 0 || m > n || n < 0) return 0;
    return 1ll * fac[n] * ifac[n - m] % P;
}

int main() {
    int T, N, n, m;
    vector<pair<int,int>> d;
    scanf("%d", &T);
    for (int tid = 0; tid < T; tid ++) {
        scanf("%d%d", &n, &m);
        N = max(max(N, n), m);
        d.push_back(make_pair(n, m));
    }
    init(N);
    for (int tid = 0; tid < T; tid ++) {
        int n = d[tid].first, m = d[tid].second;
        int ans = 0;
        for (int k = 0; k <= n; k ++) {
            int t = get_a(m - k, n - k);
            t = 1ll * t * t % P;
            t = 1ll * t * get_c(m, k) % P;
            t = 1ll * t * get_a(n, k) % P;
            if (k & 1) t = P - t;
            ans += t, ans -= ans >= P ? P : 0;
        }
        printf("%d\n", ans);
    }
    return 0;
}