#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define INF 0x7fffffff
#define LL_INF 0x7fffffffffffffff
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
// [&](int x, int y){ return v[x] < v[y];}


void solve(){
    ll k, l, r, t, x, y;
    cin >> k >> l >> r >> t >> x >> y;


    if (k + y <= r) k = k + y;

    if (x > y) {
        if (k - x < l) {
            cout << "No" << endl;
            return;
        }
        ll days = (k - l) / (x - y);
        
        if (days < t) {
            cout << "No" << endl;
            return;
        } 

        k -= (t-1) * (x-y);
        if (k - x < l) {
            cout << "No" << endl;
            return;
        }
        cout << "Yes" << endl;
        return;
    }

    if (x == y) {
        if (k - x >= l) {
            cout << "Yes" << endl;
        } else{
            cout << "No" << endl;
        }
        return;
    }

    if (k - ((k-l)/x)*x + y > r) {
        if (t <= (k-l)/x) {
            cout << "Yes" << endl;
            return;
        }
        cout << "No" << endl;
        return;
    }

    ll bt = y / x;
    ll yr  = y % x ;

    if (y==0) {
        cout << "Yes" << endl;
        return;
    }

    int ind = 0;
    ll days = (k-l)/x;
    

    int vis[x+3];
    for (int i = 0; i < x+3; i++) {
        vis[i] = 0;
    }

    ll bot = k - ((k-l)/x)*x;
    while (bot + y <= r) {
        bot += yr;
        if (bot - x >= l) {
            days++;
            bot -= x;
        }
        ind++; 
        if (ind > x) break;
    }

    if(ind > x) {
        cout << "Yes" << endl;
        return;
    }

    days += (ind) * bt;

    if (t > days) {
        cout << "No" << endl;
        return;
    }
    cout << "Yes" << endl;

     
}


int main(void)
{
    solve();
    return 0;
}