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;
long long int d[1001000];
int main() {
  d[1] = 1;
  long long int i, j, k, a, b, c, m, div, sum = 0, counter;
  cin >> a >> b >> c;
  for (i = 1; i <= a; i++) {
    for (j = 1; j <= b; j++) {
      for (k = 1; k <= c; k++) {
        div = i * j * k;
        if (d[div] == 0) {
          for (m = 2, counter = 2; m * m < div + 1; m++) {
            if (div % m == 0) {
              counter++;
              if (div / m != m) {
                counter++;
              }
            }
          }
          d[div] = counter;
        }
        sum += d[div];
        sum %= 1073741824;
      }
    }
  }
  cout << sum << endl;
  return 0;
}