#include <atcoder/modint>
#include <iostream>
#include <vector>

using namespace std;
using mint = atcoder::modint998244353;

void solve() {
    int n, m;
    cin >> n >> m;

    auto cdp = vector(m, vector(m, mint(0)));
    auto sdp = vector(m, vector(m, mint(0)));
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < m; ++j) {
            if (i == j) continue;
            cdp[i][j] = 1;
            sdp[i][j] = i + j;
        }
    }
    n -= 2;

    while (n--) {
        auto ncdp = vector(m, vector(m, mint(0)));
        auto nsdp = vector(m, vector(m, mint(0)));

        for (int j = 0; j < m; ++j) {
            // i < j > k
            {
                vector<mint> csum(m + 1, 0), ssum(m + 1, 0);
                for (int i = 0; i < m; ++i) {
                    csum[i + 1] = csum[i] + cdp[i][j];
                    ssum[i + 1] = ssum[i] + sdp[i][j];
                }

                for (int k = 0; k < j; ++k) {
                    ncdp[j][k] = csum[j] - cdp[k][j];
                    nsdp[j][k] = ssum[j] - sdp[k][j] + ncdp[j][k] * k;
                }
            }

            // i > j < k
            {
                vector<mint> csum(m + 1, 0), ssum(m + 1, 0);
                for (int i = m - 1; i >= 0; --i) {
                    csum[i] = csum[i + 1] + cdp[i][j];
                    ssum[i] = ssum[i + 1] + sdp[i][j];
                }

                for (int k = j + 1; k < m; ++k) {
                    ncdp[j][k] = csum[j] - cdp[k][j];
                    nsdp[j][k] = ssum[j] - sdp[k][j] + ncdp[j][k] * k;
                }
            }
        }

        swap(cdp, ncdp);
        swap(sdp, nsdp);
    }

    mint cans = 0, sans = 0;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < m; ++j) {
            cans += cdp[i][j];
            sans += sdp[i][j];
        }
    }

    cout << cans.val() << " " << sans.val() << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}