#include using namespace std; //#pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; //const ll dy[9]={1,0,-1,0,1,1,-1,-1,0}; //const ll dx[9]={0,1,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } const int mod = MOD9; const int max_n = 200005; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } bool operator==(const mint &p) const { return x == p.x; } bool operator!=(const mint &p) const { return x != p.x; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} using vm=vector; using vvm=vector; struct combination { vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } }comb(max_n); //ちゃんと確認してない //https://onlinejudge.u-aizu.ac.jp/beta/review.html#HUPC2021Day1/6415337 vm gauss_jordan(const vvm &A,const vm &b){ int n=A.size(); vvm B(n,vm(n+1)); rep(i,n){ rep(j,n)B[i][j]=A[i][j]; } rep(i,n)B[i][n]=b[i]; rep(i,n){ int pivot=i;//係数が0になることを防ぐ for(int j=i;jB[pivot][i].x)pivot=j; } swap(B[i],B[pivot]); for(int j=i+1;j<=n;j++)B[i][j]/=B[i][i]; rep(j,n){ if(i!=j){ for(int k=i+1;k<=n;k++)B[j][k]-=B[j][i]*B[i][k]; } } } vm x(n); rep(i,n)x[i]=B[i][n]; return x; } void solve(){ ll n,k;cin >> n >> k; vvm mat(n,vm(n)); rep(i,n){ mat[i][i]=1; } mint den=2*k+1;den=den.inv(); rep(i,n){ for(ll t=i-k;t<=i+k;t++){ if(t>=0&&t> t; while(t--)solve(); }