#include <bits/stdc++.h>

#define fi first
#define se second
#define forn(i,n) for(int i=0; i< (int)n; ++i)
#define for1(i,n) for(int i=1; i<= (int)n; ++i)
#define fore(i,l,r) for(int i=(int)l; i<= (int)r; ++i)
#define ford(i,n) for(int i=(int)(n) - 1; i>= 0; --i)
#define fored(i,l,r) for(int i=(int)r; i>= (int)l; --i)
#define pb push_back
#define el '\n'
#define d(x) cout<< #x<< " " << x<<el
#define ri(n) scanf("%d",&n)
#define sz(v) ((int)v.size())
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef pair<char,int> pci;
typedef tuple<int, int, int> tiii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;

const ll inf = 1e18;
const int nax = 2e6+200;

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

bool solve1(){
  set<ll> ciclo;
  while(t>0){
    ll val = k / x;
    t -= val;
    k -= val*x;
    if(ciclo.count(k) || t <= 0) return true;
    ciclo.insert(k);
    if(k + y <= r){
      k += y;
    }else{
      return false;
    }
  }
  return true;
}

bool solve2(){
  ll diff = x - y;
  if(k + y <= r) k+=y;
  k -= x;
  --t;
  if(k<0) return false;
  if(k/diff < t) return false;
  return true;
}

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  cout<< setprecision(20)<< fixed;
  cin>> k>> l>> r>> t>> x>> y;
  r-= l;
  k-= l;
  l = 0;
  if(y>=x){
    if(solve1()) cout<< "Yes"<<el;
    else cout<< "No"<<el;
  }else{
    if(solve2()) cout<< "Yes"<<el;
   else cout<< "No"<<el;    
  }
}
