#ifdef NACHIA #define _GLIBCXX_DEBUG #else #define NDEBUG #endif #include <iostream> #include <string> #include <vector> #include <algorithm> using i64 = long long; using u64 = unsigned long long; #define rep(i,n) for(int i=0; i<int(n); i++) const i64 INF = 1001001001001001001; template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; } template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; } #include <atcoder/modint> #include <atcoder/convolution> using Modint = atcoder::static_modint<998244353>; using namespace std; void testcase(){ int N, M; cin >> N >> M; vector<vector<Modint>> dp(N+1); dp[0].push_back(1); for(int k=1; k<=N; k++){ auto tmp = dp[k-1]; tmp.insert(tmp.begin(), Modint(0)); tmp[0] += 1; tmp = atcoder::convolution(tmp, dp[k-1]); if(int(tmp.size()) >= M + 1) tmp.resize(M + 1); dp[k] = move(tmp); } dp[N].resize(M + 1); cout << dp[N][M].val() << '\n'; } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); testcase(); return 0; }