Let's denote *d*(*n*) as the number of divisors of a positive integer *n*. You are given three integers *a*, *b* and *c*. Your task is to calculate the following sum:

Find the sum modulo 1073741824 (2<sup class="upper-index">30</sup>).
The first line contains three space-separated integers *a*, *b* and *c* (1 ≤ *a*, *b*, *c* ≤ 100).
def num_divisors(num):
    divisors = 0
    for i in range(1, int(num**0.5) + 1):
        if num % i == 0:
            divisors += 2  
            if i == num // i:
                divisors -= 1  
    return divisors

a, b, c = map(int, input().split())
ans = 0

for i in range(1, a + 1):
    for j in range(1, b + 1):
        for k in range(1, c + 1):
            divisors_count = num_divisors(i * j * k)
            ans += divisors_count

print(ans)

		 	 		  	 					  	   			  	 		