#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif

#define int long long
#define ll long long
#define ull unsigned long long
#define P pair<int,int>
#define ld long double

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using vvvvvi = vector<vvvvi>;

using vp = vector<P>;
using vvp = vector<vp>;
using vvvp = vector<vvp>;
using vvvvp = vector<vvvp>;
using vvvvvp = vector<vvvvp>;

using vs = vector<string>;
using vvs = vector<vs>;
using vvvs = vector<vvs>;
using vvvvs = vector<vvvs>;
using vvvvvs = vector<vvvvs>;

using vc = vector<char>;
using vvc = vector<vc>;
using vvvc = vector<vvc>;
using vvvvc = vector<vvvc>;
using vvvvvc = vector<vvvvc>;

using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vvvvvb = vector<vvvvb>;

using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vvvvd = vector<vvvd>;
using vvvvvd = vector<vvvvd>;

using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vvvvld = vector<vvvld>;
using vvvvvld = vector<vvvvld>;

#define rep(i,n) for(int i = 0; i < n; i++) // 0, 1, ..., n-1
#define REP(i,a,b) for(int i = a; i < b; i++) // a, a+1, ..., b-1
#define drep(i,n) for(int i = n; i >= 0; i--) // n,n-1, ..., 0
#define DREP(i,a,b) for(int i = a; i >= b; i--) // a, a-1, ..., b

#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define pob pop_back
#define fi first
#define se second

#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define fail cout << -1 << endl
#define YN {cout << "Yes" << endl;} else {cout << "No" << endl;}

struct FastIO {
    FastIO() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(16);
    }
} fastio;

template<class T> 
T vmin(vector<T> &a) {
    return *min_element(all(a));
}

template<class T>
T vmax(vector<T> &a) {
    return *max_element(all(a));
}

template<class T>
T vsum(vector<T> &a) {
    return accumulate(all(a), 0LL);
}

template<class T>
bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    else {
        return false;
    }
}

template<class T>
bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    else {
        return false;
    }
}

template<class... Vecs>
void vin(int size, Vecs&... vecs) {
    for(int i = 0; i < size; i++) {
        ((cin >> vecs[i]), ...);
    }
}

void vpin(int size, vp &a) {
    for(int i = 0; i < size; i++) {
        cin >> a[i].fi >> a[i].se;
    }
}

template<class T>
void vvin(int h, int w, vector<vector<T>> &a) {
    for(int i = 0; i < h; i++) {
        for(int j = 0; j < w; j++) {
            cin >> a[i][j];
        }
    }
}

template<class T>
void print(vector<T> a, bool flag = true) {
    for(int i = 0; i < (int)a.size(); i++) {
        if(i != 0) cout << ' ';
        cout << a[i];
    }
    if(flag) cout << endl;
}

const int INF = (1LL << 62) - (1LL << 31);
const ld EPS = 1e-9;
const vi dx = {1, 0, -1, 0, 1, -1, -1, 1};
const vi dy = {0, 1, 0, -1, 1, 1, -1, -1};

bool out_of_grid(int h, int w, int x, int y) {
    if(x >= 0 && x < h && y >= 0 && y < w) return false;
    else return true;
}

void make_graph(int edge, vvi &g, bool undirected = true) {
    for(int i = 0; i < edge; i++) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        g[a].push_back(b);
        if(undirected) g[b].push_back(a);
    }
}
void make_weighted_graph(int edge, vvp &g, bool undirected = true) {
    for(int i = 0; i < edge; i++) {
        int a, b, w;
        cin >> a >> b >> w;
        a--; b--;
        g[a].push_back(make_pair(b, w));
        if(undirected) g[b].push_back(make_pair(a, w));
    }
}
vi sieve(int n) {
    vb isPrime(n+1,true);
    isPrime[0] = isPrime[1] = false;
    for(int i = 2; i <= n; i++) {
        if(!isPrime[i]) continue;
        for(int j = i*i; j<=n; j+=i) {
            isPrime[j] = false;
        }
    }
    vi p;
    rep(i,n+1) if(isPrime[i]) p.pb(i);
    return p;
}
// main
template<class T> 
struct Segtree {
	int n;
	vector<T> t;
	function<T(T,T)> op;
	T e;
	
	Segtree(int sz, function<T(T,T)> op, T e) : op(op), e(e) {
		n = 1;
		while(n < sz) n <<= 1;
		t.assign(2*n, e);
	}
	
	void update(int i, T x) { // [l,r)
		i += n;
		t[i] = x;
		while(i > 1) {
			i /= 2;
			t[i] = op(t[2*i], t[2*i+1]);
		}
    }

    T query(int l, int r) { // [l,r)
		T resL = e, resR = e;
		l += n;
		r += n;
		while(l < r) {
			if(l % 2 == 1) {
				resL = op(resL, t[l]);
				l++;
			}
			if(r % 2 == 1) {
				r--;
				resR = op(resR, t[r]);
			}
            l /= 2;
            r /= 2;
        }
        return op(resL, resR);
	}

    T get(int i) {
        return t[i+n];
    }
};
using mint = modint998244353;
signed main() {
    int a,b,c,d,s; cin>>a>>b>>c>>d>>s;
    if(a*c + b*d <= s) YN;
}