#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 998244353;
int main() {
  int n, m;
  cin >> n >> m;
  vector<int> dp(m + 2, 0);
  dp[0] = 1;
  for (int i = 0; i < m; i++) {
    (dp[i + 1] += dp[i]) %= mod;
    if (n != 1) (dp[min(i + n, m + 1)] += dp[i]) %= mod;
  }
  cout << dp[m] << endl;
  return 0;
}