#include <cstdio>
#include <iostream>
using namespace std;
const long long mod = 1e9 + 7;
long long dp[2005][2005][2];
int main(){
	dp[1][0][0] = 1;
	for(int i = 2;i <= 2000;i++){
		for(int j = 0;j <= i - 2;j++){
			dp[i][j][0] = (dp[i][j][0] + dp[i - 1][j][1] * (i - j - 1) + dp[i - 1][j][0] * (i - j - 2)) % mod;
			dp[i][j][1] = (dp[i][j][1] + dp[i - 1][j][1]) % mod;
			if(j > 0) dp[i][j - 1][0] = (dp[i][j - 1][0] + dp[i - 1][j][0] * j + dp[i - 1][j][1] * (j - 1)) % mod;
			dp[i][j + 1][1] = (dp[i][j + 1][1] + dp[i - 1][j][1] + dp[i - 1][j][0] * 2) % mod;
		}
	}
	int q; scanf("%d",&q);
	for(int i = 1;i <= q;i++){
		int n,k; scanf("%d%d",&n,&k);
		printf("%lld\n",(dp[n][k][0] + dp[n][k][1]) % mod);
	}
	return 0;
}