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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class NumberChallenge {
    public static void main(String[]args) throws IOException{
        BufferedReader imput=new BufferedReader(new InputStreamReader(System.in));
        String[] arreglo=imput.readLine().split(" ");
        int a =Integer.parseInt(arreglo[0]);
        int b =Integer.parseInt(arreglo[1]);
        int c =Integer.parseInt(arreglo[2]);
        long contador=0;
        long[] algo=criba(1000001);
        for(int i=1;i<=a;i++){
            for(int j=1;j<=b;j++){
                for(int k=1;k<=c;k++){
                    contador=(contador + algo[i*j*k])%1073741824;
                }
            }
        }
        System.out.println(contador);
        
    }
    public static long[] criba(int numero){
        long[] arreglo=new long[numero+1];
        for(int i=0;i<=numero;i++){
            arreglo[i] = 1; 
        }
        for(int i=2;i<=numero;i++){
            for(int j=1;j*i<=numero;j++){
                arreglo[j*i] = arreglo[j*i]+1; 
            }
        }
        arreglo[0]=0;
        arreglo[1]=1;
        return arreglo;
    }
    

}