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 practice {
	public static void main(String[] args) {

		Scanner input = new Scanner(System.in);
		int a = input.nextInt();
		int b = input.nextInt();
		int c = input.nextInt();
		long ans = 0;
		int m = a * b * c;
		long[] sol = new long[m + 1];
		final int MOD = 1073741824  ;
		
		for (int i = 1; i <= a; i++)
			for (int j = 1; j <= b; j++)
				for (int k = 1; k <= c; k++)
					ans += numberOfDivisors(i * j * k, sol);
	
		System.out.println(ans % MOD);
	}
	
	public static long numberOfDivisors(long n, long[] sol)
	{
		long ans = 0;
		
		if (sol[(int) n] != 0)
			return sol[(int) n];
		
		for (int i = 1; i * i <= n; i++)
		{
			if (n % i == 0)
			{
				ans++;
				if (i * i != n)
					ans++;
			}
		}
		sol[(int) n] = ans;
		
		return ans;
	}
}
