Problem: 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 ≤ 2000).

Output

Print a single integer — the required sum modulo 1073741824 (230).

Examples

Input

2 2 2


Output

20


Input

4 4 4


Output

328


Input

10 10 10


Output

11536

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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> memo;
long long calc(long long x) {
  if (memo.find(x) != memo.end()) return memo[x];
  long long ans = 0;
  for (long long i = 1; i <= sqrt(x); i++)
    if (x % i == 0) ans += (((i * i) == x) ? 1LL : 2LL);
  memo[x] = ans;
  return ans;
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  long long ans = 0;
  for (long long i = 1; i <= a; i++)
    for (long long j = 1; j <= b; j++)
      for (long long k = 1; k <= c; k++)
        ans = (ans + calc(i * j * k)) % 1073741824LL;
  cout << ans << endl;
  return 0;
}