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).
a,b,c=map(int,input().split())
l=(a*b*c)+1
d=[1]*l
for i in range(2,l):
    j=i
    while j < l :
        d[j]+=1
        j+=i
sum=0
for i in range(1,a+1):
    for j in range(1,b+1):
        for k in range(1,c+1):
            sum+=d[i*j*k]
print(sum)
