#include <bits/stdc++.h>

constexpr int mod = 998244353;

inline int fmod(int x) {
    return x >= mod ? x - mod : x;
}

inline void add(int &x, int v) {
    x = fmod(x + v);
}

inline int fpow(int x, int k = mod - 2) {
    int res = 1;
    for (; k; k >>= 1, x = 1ll * x * x % mod)
        if (k & 1)
            res = 1ll * res * x % mod;
    return res;
}

int n, m;
int f[105][105];
int C[105][105], S[105][105], c[105][105], fac[105], inv[105];

int main() {
    for (int i = 0; i <= 100; i++) {
        C[i][0] = 1;
        for (int j = 1; j <= i; j++)
            C[i][j] = fmod(C[i - 1][j - 1] + C[i - 1][j]);
    }
    S[0][0] = 1;
    for (int i = 1; i <= 100; i++) {
        for (int j = 1; j <= i; j++)
            S[i][j] = fmod(1ll * j * S[i - 1][j] % mod + S[i - 1][j - 1]);
    }
    fac[0] = 1;
    for (int i = 1; i <= 100; i++) 
        fac[i] = 1ll * fac[i - 1] * i % mod;
    for (int i = 0; i <= 100; i++)
        for (int j = 0; j <= i; j++)
            c[i][j] = 1ll * S[i][j] * fac[j] % mod;
    for (int i = 1; i <= 100; i++)
        inv[i] = fpow(i);
    std::cin >> n >> m;
    for (int l = 1; l <= n; l++)
        for (int l1 = 0; l1 + 1 <= l; l1++)
            for (int l2 = 0; l2 + l1 + 1 <= l; l2++) {
                int k = l - l1 - l2;
                for (int p1 = (l1 != 0); p1 <= l1; p1++)
                    for (int p2 = (l2 != 0); p2 <= l2; p2++) 
                        add(f[l1 + l2 + k][p1 + p2 + 1], 1ll * fmod(fmod(1ll * c[l2][p2] * f[l1][p1] % mod + 1ll * c[l1][p1] * f[l2][p2] % mod) + 1ll * c[l1][p1] * c[l2][p2] % mod * l % mod) * k % mod * inv[l1 + l2 + k] % mod * C[l1 + l2 + k][l1] % mod * C[l2 + k][l2] % mod);
                    
            }
    int ans = 0;
    for (int i = 1, c = 1; i <= n; i++) {
        c = 1ll * (m - i + 1) * fpow(i) % mod * c % mod;
        add(ans, 1ll * c * f[n][i] % mod);
    }
    std::cout << ans << '\n';
}