It is known that fleas in Berland can jump only vertically and horizontally, and the length of the jump is always equal to s centimeters. A flea has found herself at the center of some cell of the checked board of the size n × m centimeters (each cell is 1 × 1 centimeters). She can jump as she wishes for an arbitrary number of times, she can even visit a cell more than once. The only restriction is that she cannot jump out of the board.

The flea can count the amount of cells that she can reach from the starting position (x, y). Let's denote this amount by dx, y. Your task is to find the number of such starting positions (x, y), which have the maximum possible value of dx, y.

Input

The first line contains three integers n, m, s (1 ≤ n, m, s ≤ 106) — length of the board, width of the board and length of the flea's jump.

Output

Output the only integer — the number of the required starting positions of the flea.

Examples

Input

2 3 1000000


Output

6


Input

3 3 2


Output

4
#include <bits/stdc++.h>
using namespace std;
const int infi = 1e9;
const long long int infl = 1e18;
const int MOD = 1e9 + 7;
long long int log_2(long long int n) {
  return (n > 1ll) ? 1ll + log_2(n / 2) : 0ll;
}
inline void add(long long int &a, long long int b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
inline void sub(long long int &a, long long int b) {
  a -= b;
  if (a < 0) a += MOD;
}
inline string IntToString(long long int a) {
  char x[100];
  sprintf(x, "%lld", a);
  string s = x;
  return s;
}
inline long long int StringToInt(string a) {
  char x[100];
  long long int res;
  strcpy(x, a.c_str());
  sscanf(x, "%lld", &res);
  return res;
}
inline string GetString(void) {
  char x[1000005];
  scanf("%s", x);
  string s = x;
  return s;
}
inline string uppercase(string s) {
  int n = (int)s.size();
  for (int(i) = (0); (i) < (n); ++(i))
    if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}
inline string lowercase(string s) {
  int n = (int)s.size();
  for (int(i) = (0); (i) < (n); ++(i))
    if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}
inline void OPEN(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}
void showarr(long long int arr[], long long int n) {
  int i;
  for (i = 0; i < n; i++) {
    cout << arr[i] << " ";
  }
  cout << endl;
}
void showvec(vector<long long int> v) {
  int i;
  for (i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << endl;
}
int isPalindrome(string str) {
  int l = 0;
  int h = str.length() - 1;
  while (h > l) {
    if (str[l++] != str[h--]) {
      return 0;
    }
  }
  return 1;
}
void showvecpair(vector<pair<long long int, long long int> > v) {
  for (int i = 0; i < (int)v.size(); i++) {
    cout << v[i].first << " " << v[i].second << endl;
  }
}
bool sortbysec(const pair<long long int, long long int> &a,
               const pair<long long int, long long int> &b) {
  return (a.second < b.second);
}
void bin(unsigned n) {
  unsigned i;
  for (i = 1 << 31; i > 0; i = i / 2) (n & i) ? printf("1") : printf("0");
}
long long int cntset(long long int n) {
  bitset<64> b1(n);
  return b1.count();
}
long long int p[100005];
void seive() {
  long long int i, j;
  for (i = 0; i < 100005; i++) p[i] = i;
  for (i = 2; i <= sqrt(100005); i++) {
    if (p[i] != i) continue;
    for (j = i * i; j < 100005; j += i) {
      if (p[j] == j) p[j] = i;
    }
  }
  return;
}
long long int power(long long int n, long long int x) {
  long long int j = n, prod = 1;
  while (x) {
    if (x % 2) {
      prod = ((prod % MOD) * (j % MOD)) % MOD;
    }
    j = (j * j) % MOD;
    x = x / 2;
  }
  return prod;
}
void solve() {
  long long int w, y, u, v, c = 0, k, m, l, a, b, n, i, j, max = INT_MIN,
                            min = INT_MAX, ctr = m, cnt = n, x, ans;
  cin >> n >> m >> k;
  ans = n * m;
  ctr = m;
  cnt = n;
  y = (n - 1) / k;
  if (y > 0) {
    c = -1;
    if (n - k * y > 0)
      cnt = (y + 1ll) * (n - k * y);
    else
      cnt = (y + 1ll);
  }
  x = (m - 1) / k;
  if (x > 0) {
    c = -1;
    if (m - k * x > 0)
      ctr = (x + 1ll) * (m - k * x);
    else
      ctr = (x + 1ll);
  }
  if (c == 0)
    cout << ans << endl;
  else
    cout << cnt * ctr << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int i, T;
  T = 1;
  for (i = 1; i <= T; i++) {
    solve();
  }
  return 0;
}
