#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define PI 3.141592653589793
//#include <atcoder/all>
//using namespace atcoder;
//using Mint = modint;


int main(){
   ll k, l, r, t, x, y; cin >> k >> l >> r >> t >> x >> y;
  int cnt = 0; k-=l;
  if(x>y){
    if(k+y<=r-l) k+=y;
    k-=x;
    t--;
    if(k<0){
      cout << "No" << endl; return 0;
    }
    if(t==0){
      cout << "Yes" << endl; return 0;
    }
    if((x-y)>=longinf/t + 1){
      cout << "No" << endl; return 0;
    }
    k-=(x-y)*t;
    if(k>=0){
      cout << "Yes" << endl;
    }
    else cout << "No" << endl;
    return 0;
  }  
  while(t>0 && cnt<=1000000){
    t-=k/x;
    if(k/x==0){
      if(cnt!=0){
        cout << "No" << endl; return 0;
      }
    }
    if(t<=0){
      cout << "Yes" << endl; return 0;
    }
    k%=x;
    //cout << k << endl;
    k+=y;
    //cout << k << " " << t-1 << endl;
    if(k>r-l){
      cout << "No" << endl; return 0;
    }
    cnt++; 
  }
  if(t>=0){
    cout << "Yes" << endl;
  }
}
  