The sequence of integer pairs (a1, b1), (a2, b2), ..., (ak, bk) is beautiful, if the following statements are fulfilled: 

  * 1 ≤ a1 ≤ b1 < a2 ≤ b2 < ... < ak ≤ bk ≤ n, where n is a given positive integer; 
  * all numbers b1 - a1, b2 - a2, ..., bk - ak are distinct. 



For the given number n find the number of beautiful sequences of length k. As the answer can be rather large, print the remainder after dividing it by 1000000007 (109 + 7).

Input

The first line contains integer t (1 ≤ t ≤ 2·105) — the number of the test data.

Each of the next t lines contains two integers n and k (1 ≤ k ≤ n ≤ 1000).

Output

For each test from the input print the answer to the problem modulo 1000000007 (109 + 7). Print the answers to the tests in the order in which the tests are given in the input.

Examples

Input

6
1 1
2 1
2 2
3 1
3 2
3 3


Output

1
3
0
6
2
0

Note

In the first test sample there is exactly one beautiful sequence: (1, 1).

In the second test sample, the following sequences are beautiful: 

  * (1, 1); 
  * (1, 2); 
  * (2, 2). 



In the fourth test sample, the following sequences are beautiful: 

  * (1, 1); 
  * (1, 2); 
  * (1, 3); 
  * (2, 2); 
  * (2, 3); 
  * (3, 3). 



In the fifth test sample, the following sequences are beautiful: 

  * (1, 1), (2, 3); 
  * (1, 2), (3, 3). 



In the third and sixth samples, there are no beautiful sequences.
import java.util.*;
import java.io.*;
public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		InputReader in = new InputReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		new Task().go(in, out);
	}

}

class Task {
	public static final int maxn = 1011, MOD=(int)(1e9+7);
	public void go(InputReader in, PrintWriter out) {
		long[][] dp = new long[55][maxn];
		dp[0][0] = 1;
		for(int k = 0; k <= 1001; k++) {
			for(int i = 50; i >= 0; i--) {
				for(int j = 0; j <= 1001 && j + k <= 1000; j++) {
					dp[i+1][j+k] = (dp[i+1][j+k] + dp[i][j]) % MOD;
				}
			}
		}
		long[][] c = new long[maxn][maxn];
		for(int i = 0; i <= 1001; i++) {
			for(int j = 0; j <= i; j++) {
				if(j == 0) c[i][j] = 1;
				else c[i][j] = (c[i-1][j] + c[i-1][j-1]) % MOD;
			}
		}
		long[] fac = new long[55];
		fac[0] = 1;
		for(int i = 1; i <= 50; i++) fac[i] = (fac[i-1] * i) % MOD; 
		int cas = in.nextInt();
		while(cas-- > 0) {
			int n = in.nextInt();
			int k = in.nextInt();
			if(k>50) System.out.println(0);
			else {
				long ans = 0;
				for(int i = 0; i <= n; i++) ans = (ans + dp[k][i] * c[n - i][k]) % MOD;
				ans = (ans * fac[k]) % MOD;
				System.out.println(ans);
			}
		}
	}
}

class InputReader {
	BufferedReader bf;
	StringTokenizer st;
	
	InputReader(InputStreamReader is) {
		bf = new BufferedReader(is);
	}
	
	public String next() {
		if(st == null || !st.hasMoreElements()) {
			try {
				st = new StringTokenizer(bf.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return st.nextToken();
	}
	
	public int nextInt()  {
		return Integer.parseInt(next());
	}
}
