#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
  int n,k;cin>>n>>k;
  vc dp(k,vc<mint>(k,0)); 
  vc ds(k,vc<mint>(k,0)); 
  rep(i,k)rep(j,k)if(i!=j){
    dp[i][j]=1;
    ds[i][j]=i+j;
  }
  rep(z,n-2){
    vc pre(k,vc<mint>(k,0)); swap(pre,dp);
    vc pres(k,vc<mint>(k,0)); swap(pres,ds);
    vc<mint>up(k,0),down(k,0),ups(k,0),downs(k,0);
    rep(i,k)rep(j,k){
      if(j>i)up[j]+=pre[i][j],ups[j]+=pres[i][j];
      if(j<i)down[j]+=pre[i][j],downs[j]+=pres[i][j];
    }
    //rep(i,k)up[i+1]+=up[i],down[i+1]+=down[i];
    rep(i,k)rep(j,k){
      if(j>i){
        dp[i][j]=down[i]-pre[j][i];
        ds[i][j]=downs[i]-pres[j][i]+dp[i][j]*j;
      }
      if(j<i){
        dp[i][j]=up[i]-pre[j][i];
        ds[i][j]=ups[i]-pres[j][i]+dp[i][j]*j;
      }
    }
  }
  mint ans1=0,ans2=0;
  //rep(i,k)rep(j,k)cout<<i<<' '<<j<<' '<<ds[i][j].val()<<"\n";
  rep(i,k)rep(j,k)ans1+=dp[i][j],ans2+=ds[i][j];
  cout<<ans1.val()<<' '<<ans2.val();
}