Tiling With M * 1 Tiles

easy

1. You are given a number n and a number m separated by line-break representing the length and breadth of a m * n floor.
2. You've an infinite supply of m * 1 tiles.
3. You are required to calculate and print the number of ways floor can be tiled using tiles.

Input Format

A number n A number m

Output Format

A number representing the number of ways in which the number of ways floor can be tiled using tiles.

Constraints

1 &lt;= n &lt;= 100
1 &lt;= m &lt;= 50

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

39
16

Output

Tiling With 2 * 1 Tiles

Friends Pairing