Exponial

문제

Everybody loves big numbers (if you do not, you might want to stop reading at this point). There are many ways of constructing really big numbers known to humankind, for instance:

• Exponentiation: \(  42^{2016}= \underbrace {42 \cdot 42 \cdot ... \cdot 42}_\text{2016 times} \)
• Factorials: 2016! = 2016 · 2015 · . . . · 2 · 1.

In this problem we look at their lesser-known love-child the exponial, which is an operation defined for all positive integers n as

exponial(n) = \( n^{{(n-1)}^{{{(n-2)}^{{...}^{{2^1}}}}}} \)

For example, exponial(1) = 1 and exponial(5) = \( 5^{4^{3^{2^1}}} \) ≈ 6.206 · 10¹⁸³²³⁰ which is already pretty big. Note that exponentiation is right-associative: \( a^{b^c}=a^{(b^c)} \).

Since the exponials are really big, they can be a bit unwieldy to work with. Therefore we would like you to write a program which computes exponial(n) mod m (the remainder of exponial(n) when dividing by m).

입력

The input consists of two integers n (1 ≤ n ≤ 10⁹) and m (1 ≤ m ≤ 10⁹)

출력

Output a single integer, the value of exponial(n) mod m.

2 42

2

5 123456789

16317634

94 265

39