MathBase task G

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.math.BigInteger;


public class Main {

    public static final int BASE = 1000 * 1000 * 1000 + 7;
    public static final int MAX_N = 3000 + 10;

    public static int[][] T = new int[MAX_N][MAX_N];

    public static int C(int n, int k) {
        if (n == k || k == 0) {
            return 1;
        }
        if (T[n][k] == 0) {
            T[n][k] = (C(n-1, k-1) + C(n-1, k)) % BASE;
        }
        return T[n][k];
    }


    public static void main(String []args) {

        Scanner in  = new Scanner(System.in);
        int T = in.nextInt();
        for (int t = 0, N, L; t < T; ++t) {
            N = in.nextInt();
            L = in.nextInt();
            System.out.println(C(N - 1, L - 1));
        }

    }
}