popup15 hemtal 12 [converted from problem group]


2015-01-17 15:00 AKST

popup15 hemtal 12 [converted from problem group]


2016-01-17 15:00 AKST
The end is near!
Session is over.
Not yet started.
Session is starting in -2190 days 9:40:03

Time elapsed


Time remaining


Problem F

Magnus is the youngest chess grandmaster ever. He loves chess so much that he decided to decorate his home with chess pieces. To decorate his long corridor, he decided to use the knight pieces. His corridor is covered by beautiful square marble tiles of alternating colors, just like a chess board, with $n$ rows and $m$ columns. He will put images of knights on some (possibly none) of these tiles. Each tile will contain at most one knight.

The special thing about his arrangement is that there won’t be any pair of knights can attack each other. Two knights can attack each other if they are placed in two opposite corner cells of a 2 by 3 rectangle. In this diagram, the knight can attack any of the Xs.


Given the dimension of the long corridor, your task is to calculate how many ways Magnus can arrange his knights. Two arrangements are considered different if there exists a tile which contains a knight in one arrangement but not in the other arrangement (in other words, rotations and reflections are considered different arrangements).


Each input will consist of a single test case. Note that your program may be run multiple times on different inputs. Each test case will consist of a single line with two integers $n$ and $m$ ($1 \le n \le 4$, $1 \le m \le 10^{9}$) representing the dimensions of the carpet. There will be a single space between $n$ and $m$.


Output a single line with a single integer representing the number of possible arrangements, modulo $(10^{9}+9)$.

Sample Input 1 Sample Output 1
1 2
Sample Input 2 Sample Output 2
2 2
Sample Input 3 Sample Output 3
3 2