#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
#include<map>
#include<cmath>
using namespace std;

long long power(long long a,long long b,long long m)
{
    long long result = 1,power = a;
    while (b>0)
    {
        if (b%2==1)
            result = (result*power)%m;
        power = (power*power)%m;
        b/=2;
    }
    return result;
}
long long inv[111111];

int main()
{
    int t,i,j,n,k,mod=1000000007;
    long long ans;
    for(i=2;i<=100002;i++)
        inv[i]=power(i,mod-2,mod);
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&k,&n);
        ans=n;
        for(i=1;i<=k;i++)
        {
            ans=(ans*(n+i))%mod;
            ans=(ans*inv[i+1])%mod;
        }
        if(ans<0)
            ans+=mod;
        printf("%lld\n",ans);
    }
//    system("pause");
    return 0;
}