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 d(n:int):
    if n == 1:
        return 1 
    else:
        c = 2 
        for i in range(2, n):
            if n % i == 0:
                c += 1
        return c

a, b, c = [int(x) for x in input().split()]
divs = 0
for i in range(1,a+1):
    for j in range(1,b+1):
        for k in range(1,c+1):
            divs += (d(i*j*k))%(2**30)
print(divs)