#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;

typedef long long ll;

ll N, M, MOD = 998244353;
vector<ll> f(1000001, -1);

ll solve(int x) {
    if (f[x] != -1) return f[x];
    if (x < N) {
        f[x] = 1;
        return 1;
    }
    f[x] = (solve(x - 1) + solve(x - N)) % MOD;
    return f[x];
}

int main() {
    cin >> N >> M;
    if (N == 1) {
        cout << "1\n";
        return 0;
    }
    cout << solve(M) << "\n";
}