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 count_divisors(x):
    divisors = 0
    for i in range(1, x + 1):
        if x % i == 0:
            divisors += 1
    return divisors

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

MOD = 1073741824  # 2^30
total_sum = 0

for i in range(1, a + 1):
    for j in range(1, b + 1):
        for k in range(1, c + 1):
            product = i * j * k
            divisors = count_divisors(product)
            total_sum += divisors

print(total_sum % MOD)

  					  			 	  	 		   			 	 	