#include <bits/stdc++.h>

using namespace std;

long long MOD=1000000007;

int main()
{
    long long t,n,k,i,j;
    cin>>t;
    while(t--)
    {
        cin>>n>>k;
        long long dp[k+2][n+7];
        for(i=k+1;i>=0;i--)
        {
            for(j=1;j<=n+5;j++)
            {
                dp[i][j]=0;
            }
        }
        dp[k][1]=1;
        long long ans=0;
        for(i=k;i>=1;i--)
        {
            for(j=1;j<=n;j++)
            {
                dp[i][j+1]=(dp[i][j+1]%MOD+dp[i][j]%MOD)%MOD;
                dp[i-1][n+2-j]=(dp[i-1][n+2-j]%MOD+dp[i][j]%MOD)%MOD;
            }
        }
        for(i=1;i<=k;i++)
        {
            ans=(ans%MOD+dp[i][n+1]%MOD)%MOD;
        }
        cout<<ans<<"\n";
    }

    return 0;
}