#include<bits/stdc++.h>

#define LL long long

#define rep(i,x,y) for(register int i=x;i<=y;i++)

using namespace std;

inline int read(){

    int x=,f=;char ch=getchar();

    while(!isdigit(ch)){if(ch=='-')f=-;ch=getchar();}

    while(isdigit(ch)){x=(x<<)+(x<<)+(ch^);ch=getchar();}

    return x*f;}

const int N=;

const int mod=;

LL C[N][N],f[N][N],g[N];

int T;

int main(){

    freopen("bst.in","r",stdin);

    freopen("bst.out","w",stdout);

    int nn=,hh=;

    rep(i,,nn) C[i][]=;C[][]=;

    rep(i,,nn)rep(j,,i)

    C[i][j]=1LL*(C[i-][j-]+C[i-][j])%mod;

    memset(g,,sizeof g);

    memset(f,,sizeof f);

    f[][]=g[]=;

    rep(i,,hh){

        rep(j,,nn)if(f[i][j])rep(k,,nn-j-)

        f[i+][j+k+]=(f[i+][j+k+]+1LL*f[i][j]*(g[k]*+f[i][k])%mod*C[j+k][j]%mod)%mod;

        rep(j,,nn) g[j]=(g[j]+f[i][j])%mod;}

    T=read();while(T--){

        int n=read(),h=read();

        printf("%lld\n",f[h+][n]);}

    return ;}