[POI2008] UCI-The Great Escape

给一个 $n\times m$ 的地图，计算从 $(n,1)$ 到第 $x$ 列的第 $y$ 行的路径条数 $\bmod k$，走过的点不能再走，转弯只能向右转。

Al Bytone, the infamous thief, plans a bank robbery. He knows only too well that the moment he robs the bank a pursuit will be commenced. Unfortunately, Al Bytone is a poor driver and turning left causes him great trouble. This is why he tries to devise such an escape route that at each intersection he would either ride straight ahead or turn right. He is also aware that once he passes through any intersection, the police will come and remain there, waiting for him. Therefore he may pass through any intersection at most once. Furthermore, the police are always present at certain intersections, so Al Bytone will have to avoid these intersections as well (there's no police at the intersections near the bank and near Al Bytone's hideout.) Al Bytone is planning his escape route. To your great (and rather unpleasant) surprise, he paid you a visit and told to calculate the number of different escape routes leading from the bank to his hideout complying the aforementioned requirements. Needless to say, Al Bytone does not take 'no' as an answer... The streets of Byteburg form a rectangular grid. Every street runs either in the North-South or East-West direction, and every two non-parallel streets intersect. The bank is situated to the south of the south-western-most intersection. Al Bytone will start his great escape driving north. <Task> Write a programme that: reads from the standard input the location of hideout, descriptions of intersections with police and a positive integer , calculates the number of different escape routes leading from the bank to the hideout complying the aforementioned requirements, writes out to the standard output this number's residue modulo $k$.

There are three integers in the first line of the standard input, $n$, $m$ and $k$ ($1\le n,m\le 100$, $1\le k\le 10^9$). The numbers $n$ and $m$ denote the number of streets leading in East-West and North-South direction, respectively. The second line contains two integers $x$ and $y$ ($1\le x\le n$, $1\le y\le m$). These represent the hideout's location - at the intersection of $x^{\mathrm{th}}$ street leading in Nort…

Your programme should write out the residue of the number of escape routes modulo $k$ in the first and only line of the standard output.

3 5 10
4 2
+++++
++*++
++++*

2