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.io.BufferedInputStream;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;


public class Main {

    
    
    
    public static void main(String[] args) throws NumberFormatException, IOException {
    
    //  BufferedReader in = new BufferedReader(new FileReader("Input.txt"));
        Scanner input = new Scanner(System.in);
        int a,b,c;
        a = input.nextInt();
        b = input.nextInt();
        c = input.nextInt();
        int n = a*b*c;
        int[] d = new int[1000009];
        for (int i = 1; i <= n; i++){
            for (int j = i; j <= n; j += i)
                d[j]++;
        }
        long sum = 0;
        for (int i=1; i <= a; i++)
            for (int j=1; j <= b; j++)
                for (int k = 1; k <= c; k++){
                    sum += d[i*j*k];
                    sum %= 1073741824;
                }
        System.out.println(sum);
    }
}