#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = LLONG_MAX;
void solve() {
  long long l, r, x, y, k;
  cin >> l >> r >> x >> y >> k;
  for (long long i = x; i < (long long)y + 1; i++) {
    long long star = l, end = r;
    while (star <= end) {
      long long mid = (star + end) / 2;
      if (mid == i * k) {
        cout << "YES" << endl;
        return;
      } else if (mid > i * k) {
        end = mid - 1;
      } else
        star = mid + 1;
    }
  }
  cout << "NO" << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
