#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
#include<random>
#include<complex>
#include<math.h>
#include<functional>
#include<stack>
#include<queue>
#include<set>
#include <cassert>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
const int inf = 0x3fffffff;
const ll mod = 998244353;
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll dp[1100000], n, m; dp[0] = 1; cin >> n >> m;
    if (n == 1) {
        cout << 1 << endl;
        return 0;
    }
    rep(i, m) {
        if (i +1< n) dp[i + 1] = dp[i];
        else dp[i + 1] = (dp[i] + dp[i - n+1]) % mod;
    }cout << dp[m] << endl;
}