A Byteotian ant is walking along the edges of ABCDEFGH cube:

It tries to find out, in how many ways it can go from one given vertex, to another given vertex, walking along exactly k edges (when the ant enters an edge, it will not turn back and will finally reach the second end of this edge). If the ant goes through some edge x times, we count this edge x times. The ant would like to have interesting routes, that is if the ant is in some vertex, it would like to leave this vertex using an edge other than the edge recently used to enter this vertex (i.e. it want not to use the same edge twice in a row).

Our ant is not so smart, because it can only count using integers from 0 to p-1, for some p, so you should compute the result modulo p.

Request

Write a program which:
* reads the starting and the ending vertex of the ant's route, number of edges on the ant's route, and integer p,
* computes number of interesting routes, which satisfy the ant's requests, modulo p,
* writes the answer to the standard output.

Input

The first line of the standard input contains two capital English letters v₁ and v₂, separated by a single space. The two letters denote the starting and ending vertex of the ant's route respectively. The second line contains two integers k and p, separated by a single space.

Output

Exactly one integer is to be written on the standard output. This integer is the number of interesting routes from the vertex v₁ to the vertex v₂, containing exactly k edges, modulo p.

Example

Input:
A B
3 100

Output:
2

Limitations

* A ≤ v₁, v₂ ≤ H, v₁ ≠ v₂.
* 1 ≤ k ≤ 2 x 10⁹, 2 ≤ p ≤ 10⁹.