#include <bits/stdc++.h>
using namespace std;
template <typename T>
T BigMod(T b, T p, T m) {
  if (p == 0) return 1;
  if (p % 2 == 0) {
    T s = BigMod(b, p / 2, m);
    return ((s % m) * (s % m)) % m;
  }
  return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;
}
template <typename T>
T ModInv(T b, T m) {
  return BigMod(b, m - 2, m);
}
template <typename T>
T gcd(T a, T b) {
  if (!b) return a;
  return gcd(b, a % b);
}
int main() {
  long long i, t, tot, n, j, c, q, k, st, ed, val, p, x, y, z, sum, cnt, dif,
      idx, ind, sz, m, l, r, res;
  long long rat;
  scanf("%lld %lld %lld %lld %lld", &l, &r, &x, &y, &k);
  bool fl = 0;
  for (i = l; i <= r; i++) {
    if (!(i % k)) {
      val = i / k;
      if ((val >= x && val <= y)) {
        fl = 1;
        break;
      }
    }
  }
  for (i = x; i <= y; i++) {
    val = i * k;
    if ((val >= l && val <= r)) {
      fl = 1;
      break;
    }
  }
  (fl) ? printf("YES") : printf("NO");
  printf("\n");
  return 0;
}
