#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll _;cin>>_; while(_--){ ll N,K;cin>>N>>K; vvm X(N,vm(N)); vm a(N); rep(i,0,N)rep(j,0,N){ if(i==j)X[i][j]+=2*K+1; if(abs(i-j)<=K)X[i][j]--,a[i]++; } vvm Y(N,vm(N)); rep(i,0,N)Y[i][i]=1; rep(i,0,N){ ll j=i; while(!X[j][i].val())j++; swap(X[i],X[j]); swap(Y[i],Y[j]); mint a=X[i][i]; rep(j,0,N)X[i][j]/=a,Y[i][j]/=a; rep(j,0,N)if(j!=i){ mint r=X[j][i]; //X[j]-=X[i]*r rep(k,0,N)X[j][k]-=X[i][k]*r,Y[j][k]-=Y[i][k]*r; } } vm ans(N,1); rep(i,0,N)rep(j,0,N)ans[i]+=Y[i][j]*a[j]; cout<