B' 2^k teams participate in a playoff tournament. The teams are numbered from 1 to 2^k , in order of decreasing strength. So, team 1 is the strongest one, team 2^k is the weakest one. A team with a smaller number always defeats a team with a larger number. First of all, the teams are arranged in some order during a procedure called seeding. Each team is assigned another unique value from 1 to 2^k , called a seed, that represents its starting position in the playoff. The tournament consists of 2^k - 1 games. They are held as follows: the teams are split into pairs: team with seed 1 plays against team with seed 2 , team with seed 3 plays against team with seed 4 (exactly in this order), and so on (so, 2^{k-1} games are played in that phase). When a team loses a game, it is eliminated. After that, only 2^{k-1} teams remain. If only one team remains, it is declared the champion; otherwise, 2^{k-2} games are played: in the first one of them, the winner of the game "seed 1 vs seed 2 " plays against the winner of the game "seed 3 vs seed 4 ", then the winner of the game "seed 5 vs seed 6 " plays against the winner of the game "seed 7 vs seed 8 ", and so on. This process repeats until only one team remains. After the tournament ends, the teams are assigned places according to the tournament phase when they were eliminated. In particular: Now that we established the rules, we do a little rigging. In particular, we want: For example, this picture describes one of the possible ways the tournament can go with k = 3 , and the resulting places of the teams: Some seeds are already reserved for some teams (we are not the only ones rigging the tournament, apparently). We have to fill the rest of the seeds with the remaining teams to achieve the desired placements. How many ways are there to do that? Since that value might be large, print it '...