소스 코드 제출

# n,k=map(int,input().split())

# def f(n,k):

# if k==0:

# return n

# f(n*n,k-1)

# print(f(n,k))

# import sys

# sys.setrecursionlimit(1000000)

# n=int(input())

# def f(n):

# if n==0:

# return n

# return f(n-1)+n

# print(f(n))

n,k=map(int,input().split())

def f(n,k):

if k==0:

return n

return f(n,k-1)*n

print(f(n,k))