#include <bits/stdc++.h>
using namespace std;

long long a, b, m;
const long long M = 998244353;
long long p[200001], q[200001];

long long powm(long long a, long long b) {
    long long u = 1, v = a;

    while (b > 0) {
        if (b & 1)
            u = u * v % M;

        b >>= 1;
        v = v * v % M;
    }

    return u;
}

int main() {    
    cin >> a >> b;

    p[0] = 1;
    q[0] = 1;

    for (int i = 1; i <= a + b; i++) {
        p[i] = p[i - 1] * i % M;
        q[i] = powm(p[i], M - 2);
    }

    for (int i = 0; i < b; i++)
        m = (m + p[a - 2 + i] * q[i] % M * q[a - 2] % M) % M;

    cout << m << endl;
}