public class Combinations
{
    private static long [][]perm_table = new long [2000][1001];
    public static void initTable()
    {
        for( int n = 1; n < 2000; n++ )
        {
            for(int r = 0; r <= 1000; r++ )
            {
                perm_table[n][r] = permutations(n,r);
            }
        }
    }
    public static long permutations(int n, int r)
    {
        long MOD = 1000000007;
        if( r == 0)
            return 1;
        else if( r == 1)
            return n;
        return (perm_table[n-1][r-1] + perm_table[n-1][r])%MOD;

    }
    public static void main(String [] args)
    {
        initTable();
        Scanner reader = new Scanner(System.in);
        //Read number of test cases
        int t = reader.nextInt();
        while( t-- > 0 )
        {
            int n = reader.nextInt();
            int m = reader.nextInt();
            long r = perm_table[n+m-1][m-1];
            System.out.println(r);
        }
    }
}