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.

import java.util.Scanner;

public class intopost {

	
	public static void main(String[] args)  {
		
		Scanner pew = new Scanner(System.in);
		
		int i = pew.nextInt();
		int j = pew.nextInt();
		int k = pew.nextInt();
		int s = 0;
		
		int arr[] = new int[1000001];
		
		for(int a = 1; a<=i; a++)
			for(int b = 1; b<=j; b++)
				for(int c = 1; c<=k; c++)
				{	
					if(arr[a*b*c] == 0){ 
					
						int x = func(a*b*c);
						
						s+=x;
						
						arr[a*b*c] = x;
					}
					else{
						
						s+=arr[a*b*c];
					
					}
				}
		
		System.out.println(s);
		
	}
	
	static int func(int x){
		int c=0;

	    for(int i=1;i*i<=x;i++)
	    {
	        if(i*i==x)c++;
	        else if(x%i==0)c+=2;
	    }

	    return c;
	}
	
}