import std; void main() { long N, A, B, X, Y; readf("%d %d %d %d %d\n", N, A, B, X, Y); auto H = readln.chomp.split.to!(long[]); auto P = H.heapify; bool isOK; foreach (i; 0 .. A) { if (P.empty) { isOK = true; } auto f = P.front; P.popFront; f = max(0, f-X); if (f > 0) { P.insert(f); } } if (!isOK) { long S; while (!P.empty) { auto f = P.front; P.popFront; S += f; } if (S <= B * Y) { isOK = true; } } if (isOK) { writeln("Yes"); } else { writeln("No"); } }