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:

<image>

Find the sum modulo 1073741824 (230).

Input

The first line contains three space-separated integers a, b and c (1 ≤ a, b, c ≤ 100).

Output

Print a single integer — the required sum modulo 1073741824 (230).

Examples

Input

2 2 2


Output

20


Input

5 6 7


Output

1520

Note

For the first example.

  * d(1·1·1) = d(1) = 1; 
  * d(1·1·2) = d(2) = 2; 
  * d(1·2·1) = d(2) = 2; 
  * d(1·2·2) = d(4) = 3; 
  * d(2·1·1) = d(2) = 2; 
  * d(2·1·2) = d(4) = 3; 
  * d(2·2·1) = d(4) = 3; 
  * d(2·2·2) = d(8) = 4. 



So the result is 1 + 2 + 2 + 3 + 2 + 3 + 3 + 4 = 20.
/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
 public final class Ideone
{
	static int d(int n)
	{
		int count=0;
		for(int i=1;i*i<=n;i++)
		{
			if(n%i==0 && n/i == i)
			count+=1;
			else if(n%i==0  && n/i != i)
			count+=2;
		}
	////	System.out.println(n+" "+count);
		return count;
	}
	public static void main (String[] args) throws java.lang.Exception
	{
	    Scanner sc=new Scanner(System.in);
		int a=sc.nextInt();
		int b=sc.nextInt();
		int c=sc.nextInt();
		long ans=0;
		long mod=1073741824;
		long arr[]=new long[a*b*c+1];
		for(int i=1;i<=a;i++)
		{
			for(int j=1;j<=b;j++)
			{
				for(int k=1;k<=c;k++)
				{
					if(arr[i*j*k]==0)
					arr[i*j*k]=d(i*j*k)%mod;
					ans+=arr[i*j*k]%mod;
					ans=ans%mod;
				}
			}
		}
		
		System.out.println(ans);
	}
}