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.
#include <bits/stdc++.h>
using namespace std;
int d[1000005];
int main() {
  long long k = 0, mod = 1073741824LL;
  int a, b, c;
  memset(d, 0, sizeof(d));
  for (int i = 1; i <= 1000000; i++) {
    for (int j = 1; j * i <= 1000000; j++) d[i * j]++;
  }
  cin >> a >> b >> c;
  for (int i = 1; i <= a; i++)
    for (int j = 1; j <= b; j++)
      for (int z = 1; z <= c; z++) k += d[i * j * z], k %= mod;
  cout << k;
  return 0;
}
