#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ul = unsigned long;

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

    constexpr ll mod = 998244353;

    ll n, m, res;
    cin >> n >> m;

    if (n == 1)
        res = 1;
    else if (n == m)
        res = 2;
    else if (n > m)
        res = 1;
    else
    {
        vector<ll> f(m + 1);
        f[0] = 1;

        for (ll i = 1; i <= m; ++i)
        {
            f[i] = f[i - 1];
            if (i >= n)
                f[i] += f[i - n];
            f[i] %= mod;
        }

        res = f[m - 1] + f[m - n];
        res %= mod;
    }
    cout << res << "\n";

    return 0;
}