				#include <bits/stdc++.h>
				using namespace std;
				typedef long long ll;
                #define PI 3.14159265358979
                #define EPS 1e-8
                #define mod  998244353
                #define fi first
                #define se second
                #define mp make_pair
                #define pb push_back
                #define endl "\n"
                #define NEG_INF -2e18
                #define INT_SIZE 32 			
                const ll INF=1e15;	
                const int N=4e5+50;

				ll fac[N];		 
                
                long long binpow(long long a, long long b, long long m) {
                                    a %= m;
                                    long long res = 1;
                                    while (b > 0) {
                                        if (b & 1)
                                            res = res * a % m;
                                        a = a * a % m;
                                        b >>= 1;
                        }
                        return res;
                }
                
                ll modinverse(ll a,ll m)
                {
                    return binpow(a,m-2,m);
                }
                                
                ll nck(ll n,ll r)
                {
                    return ((fac[n]*modinverse(fac[r],mod)) % mod)*modinverse(fac[n-r],mod)%mod;
                    
                }

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


					ll k,l,r,t,x,y;
					cin>>k>>l>>r>>t>>x>>y;

					if(y<x)
					{
						if(k+y<=r)
						{
							k+=y;
						}
						k-=x;
						
						
						ll days= (k-l)/(x-y)+1;
						if(days<t || k<l)
						{
							cout<<"No\n";
						}
						else
						{
							cout<<"Yes\n";
						}
					}
					else
					{
						map<ll,ll> vis;
						ll cnt=0;
						while(1)
						{
							if(k<l || k>r)
							{
								cout<<"No\n";
								return 0;
							}
							
							ll days= (k-l)/x;
							k-=days*x;
							cnt+=days;
							if(vis[k] || cnt>=t)
							{
								cout<<"Yes\n";
								return 0;
							}
							vis[k]=1;
							k+=y;
							
							
						}
					}
					

                     
                }