#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define fi first
#define se second
#define mp make_pair
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
#define FORR(i,a,b,d) for(int i=(int)(a); i<=(int)(b); i+=d)
#define FOR(i,a,b) FORR(i,a,b,1)
#define FORDD(i,a,b,d) for(int i=(int)(a);i>=(int)(b);i-=d)
#define FORD(i,a,b) FORDD(i,a,b,1)
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
const double PI=acos(-1);

set <ll> s1;
ll k,l,r,t,x,y;
bool udah[1000050];

void solve(){
	mem(udah,0);
//	s1.clear();
	cin>>k>>l>>r>>t>>x>>y;
	if(x==y){
		if(k+y<=r){
			k+=y;
		}
		k-=x;
		t--;
		cout<<(k<l?"No":"Yes")<<endl;
		return ;
	}
	else if(x>y){
		if(k+y<=r){
			k+=y;
		}
		k-=x;
		t--;
		if(k<l){
			cout<<"No"<<endl;
			return ;
		}
		double a=k-l+1,b=x-y;
		cout<<(ceil(a/b)>t?"Yes":"No")<<endl;
		return ;
	}
	else{
		while(t>0){	
			ll a=k-l,b=x ,c=a/b;
			if(c>=t){
				cout<<"Yes"<<endl;
				return ;
			}
			k-=(x*c);
			t-=c;
			if(udah[k%x]&&k+y<=r){
				cout<<"Yes"<<endl;
				return;
			}
			udah[k%x]=1;
			if(k+y<=r){
				k+=y;
			}
			k-=x;
			if(k<l||k>r){
				cout<<"No"<<endl;
				return;
			}
			t--;
		}
		cout<<"Yes"<<endl;
		return ;
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin>>t;
	while(t--){
		solve();
	}
}