#include <stdio.h>

#include <string.h>

#include <iostream>

using namespace std;

#define N 205

#define M 25

#define MOD 1000000007 

typedef long long LL;

LL dp[N][M];

int main()

{

    int t, n, k;

    cin >> t;

    while(t--)

    {

        cin >> n >> k;

        memset(dp, , sizeof dp);

        dp[][] = ; dp[][] = ;

        for(int i = ; i <= n; i++)

        {

            dp[i][] = dp[i-][];

            for(int j = ; j <= k; j++)

            {

                if(j >= i) break;

                for(int p = ; p < i-; p++)

                {

                    dp[i][j] = (dp[i][j] + dp[i-p][j-] * dp[p][]) % MOD;

                }

            }

            for(int j = ; j <= k; j++)

                dp[i][] = (dp[i][] + dp[i][j]) % MOD;

        }

        cout << dp[n][] << endl;

    }

    return ;

}