#include <bits/stdc++.h>
using namespace std;
long long int prosearch(long long int x, long long int y, long long int k,
                        long long int l, long long int r) {
  long long int lo, hi, mid, pro;
  lo = x;
  hi = y;
  while (lo <= hi) {
    mid = (lo + hi) / 2;
    pro = mid * k;
    if (pro >= l && pro <= r) {
      return mid;
    } else if (pro >= r) {
      hi = mid - 1;
    } else {
      lo = mid + 1;
    }
  }
  return -1;
}
int main() {
  long long int l, r, x, y, k, res;
  cin >> l >> r >> x >> y >> k;
  res = prosearch(x, y, k, l, r);
  if (res == -1)
    cout << "NO\n";
  else
    cout << "YES\n";
  return 0;
}
