ncr

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string,int> psi;
typedef unordered_map<int,int> mii;
typedef unordered_map<long long,long long> mll;
typedef unordered_map<string,int> msi;
typedef unordered_map<char,int> mci;
typedef unordered_set<int> si;
typedef unordered_set<long long> sll;
typedef unordered_set<string> ss;
typedef unordered_set<char> sc;
typedef map<int,int> ormii;
typedef map<long long,long long> ormll;
typedef map<string,int> ormsi;
typedef map<char,int> ormci;
typedef set<int> orsi;
typedef set<long long> orsll;
typedef set<string> orss;
typedef set<char> orsc;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;

#define FOR(i, a, b) for (auto i=a; i<=(b); i++)
#define FORd(i,b,a) for (int i =b; i >= a; i--)
#define sortinc(v)  sort(v.begin(),v.end())
#define sortdec(v)  sort(v.rbegin(),v.rend())
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define ins insert

const int MOD = 1e9+7;
//type functions here

int m(int n)
{
return n%MOD;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n=2000;
   vvll dp(n+1,(vector<ll>(n+1,0)));//2000 elements can be picked from 2000 items at max
    //no.of cols=no.of items picked----->j
    //no.of rows=no.of items existing--->i
    FOR(j,0,n)  dp[0][j]=0;//if there's no items ,no way we can pick them (impossibility is denoted by 0)
    FOR(i,0,n) dp[i][0]=1;//0 items can be picked by not picking them that's the only way note:- 0c0 is 1
    FOR(i,1,n)//building every row except 0th row
    {
      FOR(j,1,i)//building every cols except 0th col no.of cols in a row can be at max rowth number
      {
        dp[i][j]=((dp[i-1][j])%MOD/*if element not picked now j elements picked from i-1 only*/
                +(dp[i-1][j-1])%MOD)%MOD/*if element  picked now j-1 elements picked from i-1 only*/;
      }
    }
    int tc=1;
    cin>>tc;
    FOR(w,1,tc)
    {
        int n,r;
        cin>>n>>r;
        cout<<dp[n][r]<<endl;
      // cout<<"hello";
    }
    return 0;
}