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.*;

public class CF146B{
  static int MOD = 1073741824;
  static int[] memo = new int[1000001];
  
  static int calcDivsNum(int n){
    if(n==1) return 1;
    if(memo[n]>0) return memo[n];
    int cnt=0;
    int m=n;
    for(int i=1; i<m; i++){
      if(n % i == 0){
        m=n/i;
        cnt=(cnt+1) % MOD;
        if(m != i) cnt=(cnt+1) % MOD;
      }
    }
    memo[n]=cnt;
    return cnt;
  }
  
  public static void main(String args[]) throws IOException {
    BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
    String line = stdin.readLine();
    String[] prms = line.split(" ");
    
    int a=Integer.parseInt(prms[0]);
    int b=Integer.parseInt(prms[1]);
    int c=Integer.parseInt(prms[2]);
    int 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 + calcDivsNum(i*j*k)) % MOD;
        }
      }
    }
    
    System.out.println(ans);
  }
}
