#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";}


void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,K;
	cin>>N>>K;
	vector<vector<ll>> dp(K,vector<ll>(K));
	rep(i,K) rep(j,i) dp[j][i]=1;
	rep(i,N-2){
		vector<vector<ll>> n_dp(K,vector<ll>(K));
		rep(j,K) rep(k,K){
			if(i%2!=1&&k!=0) n_dp[k][k-1]+=dp[j][k];
			else if(i%2==1&&k+1!=K) n_dp[k][k+1]+=dp[j][k];
		}
		if(i%2){
			rep(j,K) rep(k,K-1) n_dp[j][k+1]+=n_dp[j][k];
		}else{
			rep(j,K) rep(k,K-1) n_dp[j][K-k-2]+=n_dp[j][K-k-1];
		}
		rep(j,K) rep(k,K) n_dp[j][k]=(n_dp[j][k]-dp[k][j])%mod;
		
		swap(n_dp,dp);
	}
	ll ans=0;
	rep(j,K) rep(k,K) ans+=dp[j][k];
	ans%=mod;
	ll ans2=(ans*(K-1)*N)%mod;
	ans*=2ll;
	cout<<(ans%mod+mod)%mod<<" "<<(ans2+mod)%mod<<"\n";
}