#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
vector<vector<long long>> matmul(vector<vector<long long>> A, vector<vector<long long>> B){
	int N = A.size();
	vector<vector<long long>> ans(N, vector<long long>(N, 0));
	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++){
			for (int k = 0; k < N; k++){
				ans[i][k] += A[i][j] * B[j][k];
				ans[i][k] %= MOD;
			}
		}
	}
	return ans;
}
vector<vector<long long>> matexp(vector<vector<long long>> A, long long b){
	int N = A.size();
	vector<vector<long long>> ans(N, vector<long long>(N, 0));
	for (int i = 0; i < N; i++){
		ans[i][i] = 1;
	}
	while (b > 0){
		if (b % 2 == 1){
			ans = matmul(ans, A);
		}
		A = matmul(A, A);
		b /= 2;
	}
	return ans;
}
int main(){
  int N, K;
  cin >> N >> K;
  vector<vector<long long>> M(K * K * 2, vector<long long>(K * K * 2, 0));
  for (int i = 0; i < K; i++){
    for (int j = 0; j < K; j++){
      for (int k = 0; k < K; k++){
        if (i != k && (i < j && j > k || i > j && j < k)){
          M[i * K + j][j * K + k]++;
          M[K * K + i * K + j][K * K + j * K + k]++;
          M[i * K + j][K * K + j * K + k] += k;
        }
      }
    }
  }
  M = matexp(M, N - 2);
  long long ans1 = 0, ans2 = 0;
  for (int i = 0; i < K; i++){
    for (int j = 0; j < K; j++){
      for (int k = 0; k < K; k++){
        for (int l = 0; l < K; l++){
          ans1 += M[i * K + j][k * K + l];
          ans2 += (i + j) * M[i * K + j][k * K + l];
          ans2 += M[i * K + j][K * K + k * K + l];
        }
      }
    }
  }
  ans1 %= MOD;
  ans2 %= MOD;
  cout << ans1 << ' ' << ans2 << endl;
}