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

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        //System.out.println();
        //int n = scanner.nextInt();
        //for(int i=0;i<n;i++)
        int n1 = scanner.nextInt();
        int n2 = scanner.nextInt();
        int n3 = scanner.nextInt();

        HashMap<Integer, Integer> map = new HashMap<>();

        long sum=0;
        for (int i = 1; i <= n1; i++) {
            for (int j = 1; j <= n2; j++) {
                for (int k = 1; k <= n3; k++) {

                    int tempprod = i*j*k;

                    if (map.containsKey(tempprod)){
                        map.put(tempprod, map.get(tempprod)+1);
                    }

                    else
                        map.put(tempprod, 1);


                }
            }


        }
        for (Map.Entry entry : map.entrySet()) {

            int key = (int) entry.getKey();
            int times = (int) entry.getValue();

            sum=sum+times*numberofdiv(key);;
        }

        System.out.println(sum);
    }

    public static int numberofdiv(int n){
        int cnt =0;
        for(int i=1;i<Math.sqrt(n);i++){
            if(n%i==0) cnt=cnt+2;
        }

        double sqrt=Math.sqrt(n);
        if(sqrt - Math.floor(sqrt) == 0)
            cnt=cnt+1;

       return cnt;
    }
}
