A professional dance company is preparing a spectacular synchronized performance. The choreography calls for dancers to be arranged in a single line formation, with male and female dancers positioned according to the artistic vision. During the performance, certain dancers will execute impressive partner lifts that require coordination and strength.
The choreographer has designed the lifts with safety in mind: each lift must be performed by two male dancers standing adjacent to each other in the formation. One dancer acts as the primary lifter while the adjacent male dancer provides spotting support. Two female dancers cannot perform a lift together, nor can a male and female dancer standing next to each other (as the choreography requires both participants to have the strength for this specific technique).
The artistic director now faces an interesting challenge: how many different ways can the male and female dancers be arranged in the line to satisfy the following conditions?
There are exactly dancers in the formation.
Exactly lifts must be performed by the dancers.
If two male dancers stand next to each other, they must perform a lift together, with one partnering from the left side and the other from the right side.
If a male dancer is flanked by two other male dancers, he participates in lifts on both his left and right sides.
If a female dancer stands to the left (or right) of a male dancer, he does not participate in a lift on his left (or right) side.
If there is no one to the left (or right) of a male dancer, he does not participate in a lift on his left (or right) side.
For example, if there are dancers in the formation who must perform lifts, there are possible arrangements.
The input contains two integers and — the number of dancers in the formation and the number of lifts. It is guaranteed that and are chosen such that the result fits within a 32-bit integer.
Output a single number — the answer to the problem.
Example 1