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.util.Arrays;
import java.util.StringTokenizer;

public class EasyNumberChallenge {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }

    private static class Task {
        final int MAX = (int)1e6 + 9;
        private int[] d = new int[MAX];
        private final int MOD = 1073741824;

        public void solve(InputReader in, PrintWriter out) {
            findAllDivisors();
            int a = in.nextInt();
            int b = in.nextInt();
            int c = in.nextInt();
            int sum = 0;
            for (int i = 1; i <= a; ++i) {
                for (int j = 1; j <= b; ++j) {
                    for (int k = 1; k <= c; ++k) {
                        sum = (sum + d[i * j * k]) % MOD;
                    }
                }
            }
            out.println(sum);
        }

        private void findAllDivisors() {
            Arrays.fill(d, 1);
            for (int i = 2; i < MAX; ++i) {
                for (int j = 1; i * j < MAX; ++j) {
                    d[i * j] = (d[i * j] + 1) % MOD;
                }
            }
        }
    }

    private static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
}
