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).
# Function to calculate the number of divisors for a given number n
def count_divisors(n):
    divisors = 0
    for i in range(1, n + 1):
        if n % i == 0:
            divisors += 1
    return divisors

# Read input values a, b, and c
a, b, c = map(int, input().split())

# Initialize the sum
total_sum = 0

# Calculate the sum of divisors for all possible products of a, b, and c
for i in range(1, a + 1):
    for j in range(1, b + 1):
        for k in range(1, c + 1):
            total_sum += count_divisors(i * j * k)

# Calculate the result modulo 2^30
result = total_sum % (2 ** 30)

# Print the result
print(result)

 	 	  	   		 	 	 	    		