#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<mint> dp[5];
  dp[0] = {1};
  auto add = [&](vector<mint>& dest, const vector<mint> src, int c) {
    if (ssize(src) + c > ssize(dest)) dest.resize(ssize(src) + c);
    rep(i, ssize(src)) dest[i+c] += src[i];
  };
  rep(i, n - 1) {
    swap(dp[0], dp[2]);
    swap(dp[3], dp[4]);
    vector<mint> ndp[5];
    rep(i, 3) rep(j, 3) add(ndp[j], dp[i], j != 0);
    add(ndp[3], dp[0], 2);
    add(ndp[2], dp[3], 1);
    add(ndp[3], dp[3], 2);
    add(ndp[4], dp[2], 2);
    add(ndp[0], dp[4], 0);
    add(ndp[4], dp[4], 2);
    swap(dp, ndp);
  }
  mint ans;
  rep(i, 4) {
    rep(j, k + 1) if (j < ssize(dp[i])) ans += dp[i][j];
  }
  cout << ans.val() << '\n';
}