#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 998244353

int main() {
  int n, m;
  cin >> n >> m;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  vector<ll> dp(m + 1);
  for (int i = 1; i <= m; ++i) {
    if (i < n) {
      dp[i] = 1;
    } else if (i == n) {
      dp[i] = 2;
    } else {
      dp[i] = (dp[i] + dp[i - 1]) % MOD;
      dp[i] = (dp[i] + dp[i - n]) % MOD;
    }
  }
  cout << dp[m] << endl;
  return 0;
}