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;

/**
 *
 * @author Donato
 */
public class EasyNumberChallenge {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] entrada=br.readLine().split(" ");
        int a=Integer.parseInt(entrada[0]);
        int b=Integer.parseInt(entrada[1]);
        int c=Integer.parseInt(entrada[2]);
        int[] d=new int[1000001];
        int[] primos=new int[10000000];
        for(int i=2;i<10000000;i++){
            if(primos[i]==0){
                for(int j=i;j<10000000;j=j+i){
                    primos[j]=i;
                }
            }
        }
        for(int i=2;i<1000001;i++){
            int ai=1;
            int divisores=1;
            int numero= i;
            int t=primos[numero];
            while(numero!=1){
                numero=numero/t;
                if(primos[numero]!=t){
                    ai=ai+1;
                    divisores=divisores*ai;
                    ai=1;
                    t=primos[numero];
                }
                else{
                    ai++;
                    t=primos[numero];
                }
            }
            d[i]=divisores*ai;
        }
        d[1]=1;
        int sum=0;
        for(int i=1;i<=a;i++){
            for(int j=1;j<=b;j++){
                for(int k=1;k<=c;k++){
                    sum=(sum+d[k*i*j]%1073741824)%1073741824;
                }
            }
        }
        System.out.println(sum);
        
    }
    
}