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.ArrayList;
import java.util.BitSet;
import java.util.Scanner;
import java.util.TreeMap;

public class P_236_B {

    static TreeMap<Integer,Integer> M=new TreeMap<Integer,Integer>();
    static BitSet primes = new BitSet(1000001);
    static ArrayList<Integer> prime = new ArrayList<Integer>();

    public static void main(String[] args) {
        Update();
    
        Scanner x = new Scanner(System.in);
        int a = x.nextInt();
        int b = x.nextInt();
        int c = x.nextInt();
        long sum = 0;
        for (int i = 1; i <= a; i++)
            for (int j = 1; j <= b; j++)
                for (int k = 1; k <= c; k++) {
                    int val=i*j*k;
                    if(M.containsKey(val))
                    {
                        
                    }
                    else
                    {
                        M.put(val,getDiv(val));
                    }
                    sum+=M.get(val);
                    sum = sum & (0x3FFFFFFF);
                }
        // 0011 1111 1111 1111 1111 1111 1111 1111
        System.out.println(sum);
    }

    

    private static int getDiv(int n) {

        int p = 1;
        for (int i = 0; prime.get(i) <= n; i++) {
            int c = prime.get(i);
            int count = 0;
            while (n % c == 0) {
                count++;
                n /= c;
            }
            p *= (count + 1);

        }
        
        if(n!=1)
            p*=2;

        return p;
    }

    private static void Update() {

        primes.set(2, 1000000);
        prime.add(2);

        for (int i = 4; i < 1000001; i += 2) {
            primes.clear(i);
        }

        for (int i = 3; i < 1000001; i++) {
            if (primes.get(i)) {
                prime.add(i);
                int count = 3;
                for (; i * count < 1000001; count += 2)
                    primes.clear(i * count);
            }
        }

    }

}
