#include <bits/stdc++.h>
using namespace std;
long long fast_pow(long long base, long long n, long long M) {
  if (n == 0) return 1;
  if (n == 1) return (base) % M;
  long long halfn = fast_pow(base, n / 2, M);
  if (n % 2 == 0)
    return (halfn * halfn) % M;
  else
    return (((halfn * halfn) % M) * base) % M;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long l, r, x, y, k, ans, p = 0;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> l >> r >> x >> y >> k;
  for (long long(i) = (long long)(x); (i) < (long long)(y + 1); ++(i)) {
    ans = (k * i);
    if ((ans >= l) && (ans <= r)) {
      p = 1;
      break;
    } else if (ans > r)
      break;
  }
  if (p == 0)
    cout << "NO";
  else
    cout << "YES";
  return 0;
}
