#include<bits/stdc++.h>

using namespace std;

#define fr(i, n) for(ll i = 0; i < n; i++)
#define frr(i, n) for(ll i = 1; i <= n; i++)
#define frm(i, n) for(ll i = n-1; i >= 0; i--)

#define pb push_back
#define f first
#define s second

typedef long long ll;
typedef pair<ll,ll> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> ponto;
typedef vector<vector<ll>> matrix;

#define mem(v, k) memset(v, k, sizeof(v));

#define db cout << "Debug" << endl;

#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

#define mp make_pair
#define pq priority_queue

#define mx(a, b) a = max(a, b);
#define mod(a, b) a = a%b;

#define MAXN 1000010
#define MOD 1000000007
#define MAXL 30
#define ROOT 1
#define INF 1000000000000000100

vector<pii> adj[MAXN];
ll pr[MAXN];
ll k, l, r, t, x, y;

ll dfs(ll v, ll tempo){
	pr[v] = 1;
	if(v == x + 1) return 0;
	ll ret = 1;
	for(auto x : adj[v]){
		ll u = x.f, w = x.s;
		if(tempo + w <= t && !pr[u]){
			ret *= dfs(u, tempo + w);
		}
	}

	return ret;
}

int main(){
	fastio;
	cin >> k >> l >> r >> t >> x >> y;
	if(x > y){
		if(k + y <= r) k += y;
		if(k - x < l){
			cout << "No" << endl;
			return 0;
		}
		k -= x;

		t--;

		if((k - l)/(x - y) + 1 <= t) cout << "No\n";
		else cout << "Yes\n";
		return 0;
	}
	if(x == y){
		if(k + y <= r) k += y;
		if(k - x < l){
			cout << "No" << endl;
			return 0;
		}
		cout << "Yes\n";
		return 0;
	}
	if(l + x + y <= r + 1){
		cout << "Yes\n";
		return 0;
	}
	if(l + y > r && x > 1){
		cout << "No\n";
		return 0;
	}
	if(x == 1){
		if(r - y < l && k - t < l) cout << "No\n";
		else cout << "Yes\n";		
		return 0;
	}

	ll i;
	for(i = l%x; (i + y)%x != (r + 1)%x; i = (i + 1)%x){
		adj[i].pb({(i + y)%x, y/x});
	//	cout << i << " " << (i + y)%x << " " << y/x << endl;
	}
	for(; i != l%x; i = (i + 1)%x){
		adj[i].pb({x + 1, (ll)1});
	//	cout << i << " " << x + 1 << " " << 1 << endl;
	}
	adj[x].pb({k%x, (k - l)/x});
	//cout << x << " " << k%x << " " << (k - l)/x << endl;
	/*
		Temos que x < y
	*/
	if(dfs(x, 0)){
		cout << "Yes\n";
	}
	else cout << "No\n";
}