Educational Codeforces Round 51 (Rated for Div. 2) D. Bicolorings

D. Bicolorings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a grid, consisting of 22 rows and nn 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 AA and BB belong to the same component if they are neighbours, or if there is a neighbour of AA that belongs to the same component with BB.

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

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

Input

The only line contains two integers nn and kk (1≤n≤10001≤n≤1000, 1≤k≤2n1≤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 998244353998244353.

Examples

input

Copy

3 4

output

Copy

12

input

Copy

4 1

output

Copy

2

input

Copy

1 2

output

Copy

2

Note

One of possible bicolorings in sample 11:

 

菜鸡被DP虐的日常，，，没怎么写过dp的题，一直在想四种状态怎么转移，原来要开三维、、、

开了三维后就好懂多了。

#include 
#include 
#include 
#include 
#include