#include<bits/stdc++.h>
using namespace std;
 
typedef    long long          ll;
typedef    vector<long long>    vi; 
typedef    vector<vi>         vvi; 
typedef    pair<long,long>      ii; 
#define    sz(a)              long((a).size()) 
#define    pb                 push_back 
#define    mp                   make_pair
#define    all(c)             (c).begin(),(c).end() 
#define    tr(c,i)            for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++) 
#define    present(c,x)       ((c).find(x) != (c).end()) 
#define    cpresent(c,x)      (find(all(c),x) != (c).end())  
#define    input(v,n)           for(ll i = 0 ; i<n ; i++) cin>>v[i]
#define    output(v,n)          for(ll i = 0 ; i<n ; i++) cout<<v[i]<<" "
#define    ff 					first
#define    ss   				second

int main()
{
	ios_base::sync_with_stdio(false);
  	cin.tie(NULL);
  	cout.tie(NULL);

  	ll k,l,r,t,x,y;
  	cin>>k>>l>>r>>t>>x>>y;
  	ll level = k;
  	set<ll> st;
  	ll tt = 0;
  	tt = (k - l)/x;
  	k-= tt*x;
  	level = k;
  	while(tt < t){
  		if(st.find(level) != st.end()){
  			cout<<"Yes\n";
  			return 0;
  		}
  		st.insert(level);
  		if( level + y <=r ){
  			level+=y;
  		}
  		ll times = (level - l)/x;
  		tt +=times;
  		level -= x*times;
  		if(times == 0){
  			cout<<"No\n";
  			return 0;
  		}
  	}
  	cout<<"Yes\n";

	return 0;
}