#include <bits/stdc++.h>
#include <cstdio>
#define int long long
#define PII pair<int, int>
#pragma GCC optimize("Ofast")
#define NO {puts("No") ; return ;}
#define YES {puts("Yes") ; return ;}
#define pb push_back
#define endl "\n"
#define fi first
#define se second
#define IOS std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
using namespace std;
mt19937 rd(time(0));
const int N = 1e5 + 10, mod = 1e9 + 7;

void solve() {
	int n, k; cin >> n >> k;
	int ans = 1;
	for (int i = 1; i <= n; i++)
	{
		ans = ans * i % mod;
		ans %= mod;
	}
	for (int i = 2; i <= n; i++)
	{
		ans = ans * min(i - 1, k) % mod;
		ans %= mod;
	}
	cout << ans << endl;

} 

signed main() {
    IOS;
    int t; cin >> t;
    while (t -- ) 
    solve();
    
    return 0;
}