#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

mint dp1[300][300][300], dp2[300][300][300];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    rep(b, k) rep(a, b) {
        dp1[0][a][b] = 1;
        dp2[0][a][b] = a + b;
    }
    rep(i, n - 2) {
        if (i % 2 == 0) {
            rep(b, k) {
                mint v1 = 0, v2 = 0;
                rep(a, b) v1 += dp1[i][a][b], v2 += dp2[i][a][b];
                rep(c, b) {
                    dp1[i+1][b][c] = v1 - dp1[i][c][b];
                    dp2[i+1][b][c] = v2 - dp2[i][c][b] + (v1 - dp1[i][c][b]) * c;
                }
            }
        } else {
            rep(b, k) {
                mint v1 = 0, v2 = 0;
                for(int a = b + 1; a < k; a++) v1 += dp1[i][a][b], v2 += dp2[i][a][b];
                for(int c = b + 1; c < k; c++) {
                    dp1[i+1][b][c] += v1 - dp1[i][c][b];
                    dp2[i+1][b][c] += v2 - dp2[i][c][b] + (v1 - dp1[i][c][b]) * c;
                }
            }
        }
    }
    mint ans1, ans2;
    rep(i, k) rep(j, k) ans1 += dp1[n - 2][i][j], ans2 += dp2[n - 2][i][j];
    ans1 *= 2, ans2 *= 2;
    cout << ans1.val() << ' ' << ans2.val() << '\n';
}