#include using namespace std; using pii = pair; using ll = long long; const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f; int n, m, w[N]; void solve() { int a, b, c, d, e; scanf("%d%d%d%d%d", &a, &b, &c, &d, &e); puts(a * c + b * d <= e ? "Yes" : "No"); } int main() { int T = 1; // scanf("%d", &T); while (T--) solve(); return 0; }