#include <bits/stdc++.h>
using namespace std;
long long dp[2001][2001][5];
int n, k;
long long MOD = 998244353;
long long add(long long a, long long b) {
  a += b;
  if (a >= MOD) a -= MOD;
  if (a < 0) a += MOD;
  return a;
}
int check(int a, int b) {
  int cnt = __builtin_popcount(a ^ b);
  if (cnt == 0) return cnt;
  if (cnt == 2)
    if (a == 0 || a == 3)
      return 1;
    else
      return 2;
  if (b == 0 || b == 3)
    return 0;
  else
    return 1;
}
long long f(int pos, int count, int bitmask) {
  long long ans = 0;
  if (pos == n) {
    if (count == k) return 1;
    return 0;
  }
  if (dp[pos][count][bitmask] != -1) return dp[pos][count][bitmask];
  if (pos == 0) {
    for (int i = 0; i < 4; i++) {
      if (i == 0 || i == 3)
        ans = add(ans, f(pos + 1, count + 1, i));
      else
        ans = add(ans, f(pos + 1, count + 2, i));
    }
    return dp[pos][count][bitmask] = ans;
  }
  for (int i = 0; i < 4; i++)
    ans = add(ans, f(pos + 1, count + check(bitmask, i), i));
  return dp[pos][count][bitmask] = ans;
}
int main() {
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  long long ans = 0;
  cout << f(0, 0, 0);
}
