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;
const double pi = 2 * acos(0.0);
const int inf = 0x3f3f3f3f;
const double infd = 1.0 / 0.0;
long long power(long long x, long long y, long long MOD) {
  long long res = 1;
  x = x % MOD;
  while (y > 0) {
    if (y & 1) res = (res * x) % MOD;
    y = y >> 1;
    x = (x * x) % MOD;
  }
  return res;
}
long long mul(long long a, long long b, long long MOD) {
  if (b == 1) {
    return a;
  }
  if (b % 2 == 0) {
    return 2 * (mul(a, b / 2, MOD) % MOD);
  } else {
    return (a + (2 * (mul(a, b / 2, MOD)) % MOD)) % MOD;
  }
}
bool ispow2(long long n) {
  if (((n & (n - 1)) == 0) && n != 0) {
    return true;
  }
  return false;
}
bool prime(int x) {
  if (x == 1) {
    return false;
  }
  if (x == 2) {
    return true;
  }
  if (x % 2 == 0) {
    return false;
  }
  for (int i = 3; i * i <= x; i += 2) {
    if (x % i == 0) {
      return false;
    }
  }
  return true;
}
int __gcd(int a, int b) {
  if (b == 0) return a;
  return __gcd(b, a % b);
}
int coprime(int a, int b) {
  if (a == b) return 0;
  if (prime(a) && prime(b)) return 1;
  if ((a == 2 && b % 2 != 0) || (b == 2 && a % 2 != 0)) return 1;
  if ((a % 2 != 0 && prime(b) && a < b) || (b % 2 != 0 && prime(a) && a > b))
    return 1;
  if (abs(a - b) == 1) return 1;
  if (a == 1 || b == 1) return 1;
  return __gcd(a, b);
}
unsigned long long lcm(unsigned a, unsigned b) {
  return ((unsigned long long)a) * (b / __gcd(a, b));
}
const int MOD = 1073741824;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int arr[1000006];
  for (int i = 1; i <= 1000000; i++) {
    for (int j = i; j <= 1000000; j += i) {
      arr[j]++;
    }
  }
  int a, b, c;
  cin >> a >> b >> c;
  int ans = 0;
  for (int i = 1; i <= a; i++) {
    for (int j = 1; j <= b; j++) {
      for (int k = 1; k <= c; k++) {
        ans += (arr[i * j * k] % MOD);
        ans %= MOD;
      }
    }
  }
  cout << ans % MOD << endl;
  return 0;
}
