#include #include using namespace std; using LL = long long; using P = pair; using Graph = vector>; const int INF = 1 << 29; const long long LINF = 1LL << 60; #define all(x) (x).begin(), (x).end() #define rep(i,n) for(int i = 0; i < (n); ++i) templatevoid chmin(T&a, T b){if(a > b) a = b;} templatevoid chmax(T&a, T b){if(a < b) a = b;} int main(){ long long N, W; cin >> N >> W; vector dp(W+1, 0); dp[0] = 1; for(int i = 1; i <= W; ++i){ dp[i] += dp[i-1]; if(i-N>=0&&N!=1) dp[i] += dp[i-N]; dp[i] %= 998244353; } // for(auto v : dp) cout << v << endl; cout << dp[W] << endl; }