Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of university studies. Consequently Noora had to leave Vičkopolis and move to Pavlopolis. Thus Leha was left completely alone in a quiet town Vičkopolis. He almost even fell into a depression from boredom!

Leha came up with a task for himself to relax a little. He chooses two integers A and B and then calculates the greatest common divisor of integers "A factorial" and "B factorial". Formally the hacker wants to find out GCD(A!, B!). It's well known that the factorial of an integer x is a product of all positive integers less than or equal to x. Thus x! = 1·2·3·...·(x - 1)·x. For example 4! = 1·2·3·4 = 24. Recall that GCD(x, y) is the largest positive integer q that divides (without a remainder) both x and y.

Leha has learned how to solve this task very effective. You are able to cope with it not worse, aren't you?


-----Input-----

The first and single line contains two integers A and B (1 ≤ A, B ≤ 10^9, min(A, B) ≤ 12).


-----Output-----

Print a single integer denoting the greatest common divisor of integers A! and B!.


-----Example-----
Input
4 3

Output
6



-----Note-----

Consider the sample.

4! = 1·2·3·4 = 24. 3! = 1·2·3 = 6. The greatest common divisor of integers 24 and 6 is exactly 6.

Difficulty: interview

Starter code:

Solutions:
a, b = map(int, input().split())
a = min(a, b)
ans = 1
for i in range(1, a + 1):
    ans *= i
print(ans)

import math
m = min(list(map(int,input().split())))
print(math.factorial(m))


read = lambda: map(int, input().split())
a, b = read()
x = min(a, b)
ans = 1
for i in range(2, x + 1):
    ans *= i
print(ans)

import math
A, B = list(map(int, input().split()))
res = min(A, B)
print(math.factorial(res))


from math import factorial as f
a, b = map(int, input().split())
print(f(min(a, b)))

import math
a,b=map(int,input().split())
print(math.factorial(min(a,b)))

from math import factorial

a, b = list(map(int, input().split()))

print(factorial(min(a, b)))



from math import factorial

a, b = map(int, input().split())
print(factorial(min(a, b)))

import math
a, b = map(int, input().split())
print(math.factorial(min(a, b)))

def list_input():
    return list(map(int,input().split()))
def map_input():
    return map(int,input().split())
def map_string():
    return input().split()
from math import factorial    
a,b = map_input()
print(factorial(min(a,b)))

a, b = map(int, input().split())

x = min(a, b)

ans = 1

for i in range(x):
	ans *= (i+1)

print(ans)

import math

a, b = list(map(int, input().split()))
print(math.factorial(min(a, b)))


import math
import itertools


def ria():
    return [int(i) for i in input().split()]

print(math.factorial(min(ria())))

from math import factorial
a, b = map(int, input().split())
print(factorial(min(a, b)))

from math import factorial as f

print(f(min(list(map(int, input().split())))))


from math import factorial 
a, b = list(map(int, input().split()))
print(factorial(min(a,b))) 


import math

print(math.factorial(min(map(int, input().split()))))

import math
string = input()
numbers = string.split(" ")
a = int(numbers[0])
b = int(numbers[1])
print(math.factorial(min([a, b])))

from sys import stdin, stdout
from math import factorial
stdout.write(str(factorial(min(map(int, stdin.readline().split())))))

a, b = list(map(int, input().split()))
c = min(a, b)

def fact(n):
	res = 1
	for i in range(1, n + 1):
		res *= i
	return res

print(fact(c))

import math
a,b = list(map(int, input().split()))
print(math.factorial(min(a,b)))


from math import factorial
a, b = list(map(int, input().split()))
print(factorial(min(a,b)))


a = list(map(int, input().split()))

import math
print(math.factorial(min(a)))


from math import factorial

a, b = map(int, input().split())
print(factorial(min(a, b)))

from math import factorial

A, B = input().split()
A, B = int(A), int(B)
print(factorial(min(A, B)))