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.
// by d555
// problem: 236 B
// site: codeforces
// strategy: dp

import java.util.*;
import java.io.*;

public class EasyNumberChallenge{
    public static boolean [] p;

    public static void main(String [] args){

    Scanner linea = new Scanner(System.in);
    PrintStream cout = System.out;

    int a = linea.nextInt();
    int b = linea.nextInt();
    int c = linea.nextInt();
    int [] dp = new int[(int) Math.pow(10,6) + 1];
    int i,j,k;
    dp[0] = 0;
    for(i=1; i<dp.length; i++)
        for(j=i; j<dp.length; j = j + i)
            dp[j]++;
    long suma = 0;
    for(i=1; i<=a; i++)
        for(j=1; j<=b; j++)
            for(k=1; k<=c; k++)
                suma += dp[i*j*k];
    cout.println(suma);
    }
}