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.*;
import java.security.KeyStore;
import java.util.*;

public class Pair {
    public static void main(String[] args) throws Exception {
        try {
            Scanner sc = new Scanner(System.in);
            PrintWriter out = new PrintWriter(System.out);
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            int[] arr = new int[1000001];
            int i,j;
            for( i=1;i<=1000000;i++){
                for( j=i;j<=1000000;j=j+i){
                    arr[j]++;
                }
            }
            long ans = 0;
            int k;
            for( i=1;i<=a;i++){
                for( j=1;j<=b;j++){
                    for( k=1;k<=c;k++){
                        ans+=arr[i*j*k];
//                        System.out.println(i*j*k);
                        ans = ans%1073741824L;
                    }
                }
            }
            System.out.println(ans);

        }
        catch (Exception e) {
        }
    }
}