#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N, K;
  cin >> N >> K;
  vector<vector<vector<long long>>> dp1(N - 1, vector<vector<long long>>(K, vector<long long>(K, 0)));
  vector<vector<vector<long long>>> dp2(N - 1, vector<vector<long long>>(K, vector<long long>(K, 0)));
  for (int i = 0; i < K; i++){
    for (int j = 0; j < K; j++){
      if (i != j){
        dp1[0][i][j]++;
        dp2[0][i][j] += i + j;
      }
    }
  }
  for (int i = 0; i < N - 2; i++){
    for (int k = 0; k < K; k++){
      long long sum11 = 0, sum12 = 0;
      for (int j = 0; j < k; j++){
        sum11 += dp1[i][j][k];
        sum12 += dp2[i][j][k];
      }
      for (int j = 0; j < k; j++){
        dp1[i + 1][k][j] += sum11;
        dp1[i + 1][k][j] += MOD - dp1[i][j][k];
        dp1[i + 1][k][j] %= MOD;
        dp2[i + 1][k][j] += sum12 + k * sum11;
        dp2[i + 1][k][j] += MOD - dp2[i][j][k];
        dp2[i + 1][k][j] += MOD - dp1[i][j][k] * k % MOD;
        dp2[i + 1][k][j] %= MOD;
      }
      long long sum21 = 0, sum22 = 0;
      for (int j = k + 1; j < K; j++){
        sum21 += dp1[i][j][k];
        sum22 += dp2[i][j][k];
      }
      for (int j = k + 1; j < K; j++){
        dp1[i + 1][k][j] += sum21;
        dp1[i + 1][k][j] += MOD - dp1[i][j][k];
        dp1[i + 1][k][j] %= MOD;
        dp2[i + 1][k][j] += sum22 + k * sum21;
        dp2[i + 1][k][j] += MOD - dp2[i][j][k];
        dp2[i + 1][k][j] += MOD - dp1[i][j][k] * k % MOD;
        dp2[i + 1][k][j] %= MOD;
      }
    }
  }
  long long ans1 = 0, ans2 = 0;
  for (int i = 0; i < K; i++){
    for (int j = 0; j < K; j++){
      ans1 += dp1[N - 2][i][j];
      ans2 += dp2[N - 2][i][j];
    }
  }
  ans1 %= MOD;
  ans2 %= MOD;
  cout << ans1 << ' ' << ans2 << endl;
}