[CSES Problem Set] Counting Tilings - Problem

Problem7561-- [CSES Problem Set] Counting Tilings

_{[Creator : ]}

Time Limit : 1.000 sec Memory Limit : 256 MiB

Your task is to count the number of ways you can fill an $n \times m$ grid using $1 \times 2$ and $2 \times 1$ tiles.

The only input line has two integers $n$ and $m$.

Print one integer: the number of ways modulo $10^9+7$.

$1≤n≤10$
$1 \le m \le 1000$

4 7