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.Arrays;
import java.util.Scanner;

public class B {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        int c = in.nextInt();
        int mod = (1 << 30) - 1;
        int n = a * b * c + 1;
        int[] D = new int[n];
        int[] S = new int[n];
        for (int i = 1; i < n; i++)
            S[i] = i;
        for (int i = 2; i * i < n; i++)
            if (S[i] == i)
                for (int j = i * i; j < n; j += i)
                    S[j] = i;
        D[1] = 1;
        for (int i = 2; i < n; i++) {
            int temp = i;
            int cnt = 0;
            while (temp % S[i] == 0) {
                temp /= S[i];
                cnt++;
            }
            D[i] = (cnt + 1) * D[temp];
        }
        long ans = 0;
        for (int i = 1; i <= a; i++)
            for (int j = 1; j <= b; j++)
                for (int k = 1; k <= c; k++)
                    ans = (ans + D[i * j * k]) & (mod);
        System.out.println(ans);
    }
}
