Room Tiling

Moiz decided to tile his room to procrastinate writing his EE! His room has dimensions $N \times M$, but as he is incredibly indecisive, he needs help with the specific tiling layout. You are tasked with finding the number of distinct ways to completely tile his room using the following two types of tiles:

• A horizontal tile of size $1 \times 2$
• A vertical tile of size $2 \times 1$

Each tile must fit entirely within the grid, and tiles cannot overlap.

Help Moiz figure out how many distinct tiling layouts he needs to choose from!

Input

The input consists of two integers $N$ and $M$ ($1 \leq N, M \leq 10$), which represent the dimensions of Moiz's room.

Output

Output a single integer: the number of distinct ways to tile Moiz's room.