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

#define FASTio ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int 
#define all(v) (v).begin(), (v).end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define printarr(v) {for(auto x : v) cout<<x<<" ";cout<<"\n";}
#define mp make_pair
#define pb push_back
#define pf push_front
#define ff first
#define ss second
#define lcm(a, b) ((a) * (b)) / __gcd(a, b)
#define umpit unordered_map<ll,ll>::iterator
#define mpit map<ll,ll>::iterator
#define setit set<ll>::iterator
#define mx(a) *max_element(all(a))
#define mn(a) *min_element(all(a))
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
const ll INF = LLONG_MAX / 2;
#define PI 3.1415926535897932384626433832795
#define mod 1000000007

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // designed by Sebastiano Vigna and found on Neal's blog
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
    // unordered_map<int,int,custom_hash> M;
};

ll bin_exp_mod(ll a,ll n)
{
    ll res=1;
    a%=mod;
    if(a==0)
        return 0;
    while(n)
    {
        if(n&1)
            res=((res%mod)*(a%mod))%mod;
        n=n>>1;
        a=((a%mod)*(a%mod))%mod;
    }
    res%=mod;
    return res;
}

int main()
{
   FASTio;
    #ifndef ONLINE_JUDGE                    //file start
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);   
    #endif                                  //file end
    ll t,i,j;
    cin>>t;
    while(t--)
    {
        ll n,k;
        cin>>n>>k;
        ll ans = 1;
        ll p=0,var;
        vector<ll> temp(n+1,0);
        for(i=k;i>=1;i--)
        {
            p = 0;
            if(i == k)
            {
                for(j=1;j<=n;j++)
                {
                    temp[j] = 1;
                }
                continue;
            }
            if(i%2 == (k-1)%2)
            {
                for(j=n;j>=1;j--)
                {
                    var = temp[j];
                    temp[j] = p;
                    p+= var;
                    p %= mod;
                    if(j == n)
                    {
                        temp[j] = 0;
                        continue;
                    }
                }
            }
            else{
                for(j=1;j<=n;j++)
                {
                    var = temp[j];
                    temp[j] = p;
                    p += var;
                    p %= mod;
                    if(j == 1)
                    {
                        temp[j] = 0;
                        continue;
                    }
                }
            }
            ans = ((ans%mod) + (p%mod))%mod;
        }
        cout<<ans<<"\n";
    }
    return 0;
}