#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001
int N,K;
pair<mint,mint> get(int x){
	vector dp(K,vector<mint>(K,0));
	vector sum(K,vector<mint>(K,0));
	if(x==0){
		rep(i,K){
			rep(j,K){
				if(i<j){
					dp[i][j] = 1;
					sum[i][j] = i+j;
				}
			}
		}
	}
	else{
		rep(i,K){
			rep(j,K){
				if(i>j){
					dp[i][j] = 1;
					sum[i][j] = i+j;
				}
			}
		}
	}
	
	rep(_,N-2){
		vector<mint> X(K),Y(K);
		rep(i,K){
			rep(j,K){
				X[j] += dp[i][j];
				Y[j] += sum[i][j];
			}
		}
		
		vector ndp(K,vector<mint>(K,0));
		vector nsum(K,vector<mint>(K,0));
		
		rep(i,K){
			rep(j,K){
				if(x!=_%2){
					if(i<j){
						ndp[i][j] += X[i] - dp[j][i];
						nsum[i][j] += Y[i] - sum[j][i];
						nsum[i][j] += (X[i]-dp[j][i]) * j;
					}
				}
				else{
					if(i>j){
						ndp[i][j] += X[i] - dp[j][i];
						nsum[i][j] += Y[i] - sum[j][i];
						nsum[i][j] += (X[i]-dp[j][i]) * j;
					}
				}
			}
		}
		swap(dp,ndp);
		swap(sum,nsum);
	}
	
	pair<mint,mint> ret(0,0);
	rep(i,K){
		rep(j,K){
			ret.first += dp[i][j];
			ret.second += sum[i][j];
		}
	}
	return ret;
	
}

int main(){
	
	cin>>N>>K;
	
	pair<mint,mint> r0 = get(0),r1 = get(1);
	
	mint a0 = r0.first+r1.first;
	mint a1 = r0.second+r1.second;
	
	cout<<a0.val()<<' '<<a1.val()<<endl;
	
	return 0;
}