import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const A = readInt();
      const B = readInt();
      const X = readLong();
      const Y = readLong();
      auto H = new long[N];
      foreach (i; 0 .. N) {
        H[i] = readLong();
      }
      
      bool check(long k) {
        BinaryHeap!(Array!long) que;
        foreach (i; 0 .. N) {
          que.insert(H[i] - k);
        }
        foreach (_; 0 .. A) {
          const h = que.front;
          que.removeFront;
          que.insert(h - X);
        }
        long sum;
        for (; !que.empty; ) {
          const h = que.front;
          que.removeFront;
          sum += max(h, 0);
        }
        return (sum <= B * Y);
      }
      
      const ans = check(0);
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}