# 巨大数の n^m % mod を求める (mod は素数)
def modpow(n: str, m: str, mod: int) -> int:
    def modulo(s: str, m: int) -> int:
        x = 0
        for c in map(int, s):
            x = (10*x + c) % m
        return x

    a = modulo(n, mod)
    b = modulo(m, mod-1)
    return pow(a, b, mod)


MOD = 129402307
N = input()
M = input()

ans = modpow(N, M, MOD)
print(ans)