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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.Set;
import java.util.HashMap;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int a = in.nextInt();
            int b = in.nextInt();
            int c = in.nextInt();
            int l = 0;
            HashMap<Long, Long> map = new HashMap<>();
            for (int i = 1; i <= a; i++) {
                for (int j = 1; j <= b; j++) {
                    for (int k = 1; k <= c; k++) {
                        long val = i * j * k;
                        if (map.containsKey(val))
                            map.put(val, map.get(val) + 1);
                        else
                            map.put(val, 1L);
                    }
                }
            }
            Set<Long> vals = map.keySet();
            long ans = 0;
            long mod = 1073741824L;
            for (long value : vals) {
                ans += (get(value, mod) * map.get(value) % mod) % mod;
                ans %= mod;
            }
            out.println(ans);
        }

        public long get(long val, long mod) {
            long ans = 0;
            for (int i = 1; i <= Math.floor((Math.sqrt(val))); i++) {
                if (val % i == 0) {
                    long other = val / i;
                    if (other == i)
                        ans++;
                    else
                        ans += 2;
                }
            }
            ans %= mod;
            return ans;
        }

    }
}

