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 Task236B {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		sc.close();
		
		int[] p = {2, 3, 5, 7 ,11 , 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
		int[][]	n = new int[101][p.length];
		for (int i = 2; i <= 100; ++i) {
			int num = i;
			for (int j = 0; j < p.length; ) {
				if (num % p[j] == 0) {
					n[i][j]++;
					num /= p[j];
				} else {
					++j;
				}
			}
		}
		
		int d = 0;
		for (int i = 1; i <= a; ++i) {
			for (int j = 1; j <= b; ++j) {
				for (int k = 1; k <= c; ++k) {
					int[] psum = new int[p.length];
					for (int ind = 0; ind < p.length; ++ind) {
						psum[ind] = n[i][ind] + n[j][ind] + n[k][ind];
					}
					int sum = 1;
					for (int ind = 0; ind < p.length; ++ind) {
						if (psum[ind] != 0) {
							sum *= (psum[ind] + 1);
						}
					}
					d = (d + sum) % 1073741824;
				}
			}
		}
		
		System.out.println(d);
	}
}