#include using namespace std; #define rep(i,n) for(int i = 0; i < (n); i++) typedef long long ll; //int MOD = 1000000007; const int MOD = 998244353; int main () { int n , m; cin >> n >> m; if (n == 1 && m == 1) { cout << 1 << endl; return 0; } vector dp(m + 11 , 0); dp[0] = 1; for (int i = 1; i <= m + 10; i++) { dp[i] = dp[i - 1]; if(i - n >= 0) dp[i] += dp[i - n]; dp[i] %= MOD; } cout << dp[m] << endl; return 0; }