#nt603. 古代猪文

古代猪文

The Pig's Ancient Text

Problem Source

SDOI2010

Problem Description

In short: compute

G∑d∣N(Nd) mod 999911659G^{\sum_{d|N} {N \choose d}} \bmod 999911659

Input Format

Exactly one line: two numbers N,GN, G, separated by a space.

Output Format

Exactly one line: one number, the remainder of the answer divided by 999911659999911659.

Sample Input

4 2

Sample Output

2048

Constraints

For all data, 1≤G,N≤1091\leq G, N\leq 10^9 are guaranteed.