#include <bits/stdc++.h>
#define int long long
using namespace std;
int k, l, r, t, x, y;
int res;
unordered_map<int, int> haxh;

bool ok(int u) {
	if (u >= l && u <= r) return true;
	else return false;
}

void slove() {
	if (ok(k + y)) k += y;
	if (x == y) {
		if (ok(k - x)) {
			res = 8e18;
			return;
		} else {
			res = 0;
			return;
		}
	} else if (x > y) {
		if (ok(k - x)) res++, k -= x;
		else return;
		int t = (k - l) / (x - y);
		res += t;
		return;
	} else {
		// cout << "----" << endl;
		if (ok(k - x)) res++, k -= x;
		else return;
		while (ok(k)) {
			int t = (k - l) / x;
			res += t;
			k -= t * x;
			if (haxh.count(k) == 0) {
				haxh[k] = 1;
			} else {
				res = 8e18;
				return;
			}
			k += y;
		}
	}	
}

int32_t main() {
	cin >> k >> l >> r >> t >> x >> y;
	slove();
	if (res >= t) puts("Yes");
	else puts("No");
	// cout << res << endl;
	return 0;	
}