#include using namespace std; using ll=long long; const ll ILL=2167167167167167167; const int INF=2100000000; #define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++) #define all(p) p.begin(),p.end() template using _pq = priority_queue, greater>; template int LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template int UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,T b){if(b bool chmax(T &a,T b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;} template void vec_out(vector &p,int ty=0){ if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'< T vec_min(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template T vec_max(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template T vec_sum(vector &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;} int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;} template T square(T a){return a * a;} #include using mint = atcoder::modint998244353; void solve(); // CITRUS CURIO CITY / FREDERIC int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; // cin >> t; rep(i, 0, t) solve(); } void solve(){ int N, K; cin >> N >> K; vector dp(N + 1, vector(3, vector(K + 1))); dp[0][0][0] = 1; rep(i, 1, N + 1){ // yoko rep(j, 0, 3) rep(k, 0, K + 1){ if (j == 2 * ((i - 1) & 1)){ dp[i][j][k] += dp[i - 1][j][k]; } else if (k != K){ dp[i][j][k + 1] += dp[i - 1][j][k]; } } // tate rep(k, 0, K + 1){ mint sum = 0; rep(j, 0, 3) sum += dp[i][j][k]; rep(j, 0, 3) dp[i][j][k] = sum; } // S rep(to, 0, i - 1){ for (int j = 0; j <= 2; j += 2){ int c = (i - to - 1) * 2; if ((to & 1) != j / 2) c++; rep(k, 0, K + 1 - c){ dp[i][2 - j][k + c] += dp[to][j][k]; } } } } mint ans = 0; rep(k, 0, K + 1) ans += dp[N][2 * (N & 1)][k]; cout << ans.val() << "\n"; }