#include <bits/stdc++.h>
unsigned long long result[1000][2001][4];
int main(void) {
  int n, k;
  scanf("%d%d", &n, &k);
  result[0][1][0] = 1;
  result[0][1][1] = 0;
  result[0][1][2] = 0;
  result[0][1][3] = 1;
  result[0][2][0] = 0;
  result[0][2][1] = 1;
  result[0][2][2] = 1;
  result[0][2][3] = 0;
  int i;
  for (i = 1; i < n; i++) {
    int kk;
    for (kk = 1; kk <= k; kk++) {
      result[i][kk][0] += result[i - 1][kk][0];
      result[i][kk][0] += result[i - 1][kk][1];
      result[i][kk][0] += result[i - 1][kk][2];
      result[i][kk][0] += result[i - 1][kk - 1][3];
      result[i][kk][0] %= 998244353;
      result[i][kk][1] += result[i - 1][kk - 1][0];
      result[i][kk][1] += result[i - 1][kk][1];
      if (kk > 2) result[i][kk][1] += result[i - 1][kk - 2][2];
      result[i][kk][1] += result[i - 1][kk - 1][3];
      result[i][kk][1] %= 998244353;
      result[i][kk][2] += result[i - 1][kk - 1][0];
      if (kk > 2) result[i][kk][2] += result[i - 1][kk - 2][1];
      result[i][kk][2] += result[i - 1][kk][2];
      result[i][kk][2] += result[i - 1][kk - 1][3];
      result[i][kk][2] %= 998244353;
      result[i][kk][3] += result[i - 1][kk - 1][0];
      result[i][kk][3] += result[i - 1][kk][1];
      result[i][kk][3] += result[i - 1][kk][2];
      result[i][kk][3] += result[i - 1][kk][3];
      result[i][kk][3] %= 998244353;
    }
  }
  printf("%lld", (result[n - 1][k][0] + result[n - 1][k][1] +
                  result[n - 1][k][2] + result[n - 1][k][3]) %
                     998244353);
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

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>

### Response

```cpp
#include <bits/stdc++.h>
unsigned long long result[1000][2001][4];
int main(void) {
  int n, k;
  scanf("%d%d", &n, &k);
  result[0][1][0] = 1;
  result[0][1][1] = 0;
  result[0][1][2] = 0;
  result[0][1][3] = 1;
  result[0][2][0] = 0;
  result[0][2][1] = 1;
  result[0][2][2] = 1;
  result[0][2][3] = 0;
  int i;
  for (i = 1; i < n; i++) {
    int kk;
    for (kk = 1; kk <= k; kk++) {
      result[i][kk][0] += result[i - 1][kk][0];
      result[i][kk][0] += result[i - 1][kk][1];
      result[i][kk][0] += result[i - 1][kk][2];
      result[i][kk][0] += result[i - 1][kk - 1][3];
      result[i][kk][0] %= 998244353;
      result[i][kk][1] += result[i - 1][kk - 1][0];
      result[i][kk][1] += result[i - 1][kk][1];
      if (kk > 2) result[i][kk][1] += result[i - 1][kk - 2][2];
      result[i][kk][1] += result[i - 1][kk - 1][3];
      result[i][kk][1] %= 998244353;
      result[i][kk][2] += result[i - 1][kk - 1][0];
      if (kk > 2) result[i][kk][2] += result[i - 1][kk - 2][1];
      result[i][kk][2] += result[i - 1][kk][2];
      result[i][kk][2] += result[i - 1][kk - 1][3];
      result[i][kk][2] %= 998244353;
      result[i][kk][3] += result[i - 1][kk - 1][0];
      result[i][kk][3] += result[i - 1][kk][1];
      result[i][kk][3] += result[i - 1][kk][2];
      result[i][kk][3] += result[i - 1][kk][3];
      result[i][kk][3] %= 998244353;
    }
  }
  printf("%lld", (result[n - 1][k][0] + result[n - 1][k][1] +
                  result[n - 1][k][2] + result[n - 1][k][3]) %
                     998244353);
  return 0;
}

```