You are given a grid, consisting of 2 rows and n columns. Each cell of this grid should be colored either black or white.

Two cells are considered neighbours if they have a common border and share the same color. Two cells A and B belong to the same component if they are neighbours, or if there is a neighbour of A that belongs to the same component with B.

Let's call some bicoloring beautiful if it has exactly k components.

Count the number of beautiful bicolorings. The number can be big enough, so print the answer modulo 998244353.

Input

The only line contains two integers n and k (1 ≤ n ≤ 1000, 1 ≤ k ≤ 2n) — the number of columns in a grid and the number of components required.

Output

Print a single integer — the number of beautiful bicolorings modulo 998244353.

Examples

Input

3 4


Output

12


Input

4 1


Output

2


Input

1 2


Output

2

Note

One of possible bicolorings in sample 1:

<image>
#include <bits/stdc++.h>
using namespace std;
long long int mod = 998244353;
long long int n, k, m;
long long int z, q, u, a1, l, r, ax, cx, ay, by, cy, ql, qr, d, x, y;
vector<pair<long long int, long long int> > v[400000];
long long int a[300000];
long long int b[600000];
long long int me(long long int a, long long int b, long long int M) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return me((a * a) % M, b / 2, M);
  else
    return (a % M * me((a * a) % M, (b - 1) / 2, M) % M) % M;
}
long long int mI(long long int a, long long int m) { return me(a, m - 2, m); }
long long int dp[1005][2005][4];
int main() {
  cin >> n >> k;
  dp[1][1][0] = 1;
  dp[1][1][3] = 1;
  dp[1][2][1] = 1;
  dp[1][2][2] = 1;
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j < 2003; j++) {
      dp[i][j][0] += dp[i - 1][j][0] + dp[i - 1][j][1];
      dp[i][j][0] += dp[i - 1][j][2] + dp[i - 1][j - 1][3];
      dp[i][j][1] += dp[i - 1][j - 1][0] + dp[i - 1][j][1];
      dp[i][j][1] += dp[i - 1][j - 2][2] + dp[i - 1][j - 1][3];
      dp[i][j][2] += dp[i - 1][j - 1][0] + dp[i - 1][j - 2][1];
      dp[i][j][2] += dp[i - 1][j][2] + dp[i - 1][j - 1][3];
      dp[i][j][3] += dp[i - 1][j - 1][0] + dp[i - 1][j][1];
      dp[i][j][3] += dp[i - 1][j][2] + dp[i - 1][j][3];
      dp[i][j][0] = dp[i][j][0] % mod;
      dp[i][j][1] = dp[i][j][1] % mod;
      dp[i][j][2] = dp[i][j][2] % mod;
      dp[i][j][3] = dp[i][j][3] % mod;
    }
  }
  long long int s = 0;
  for (int i = 0; i <= 3; i++) {
    s = (s % mod + dp[n][k][i] % mod) % mod;
  }
  cout << s % mod;
}
