#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <iostream>
#include <stdio.h>
#include <iterator>
#include <vector>
#include <cstdlib>
#include <iostream> 
#include <queue> 
#include <bits/stdc++.h>
using namespace std; 
typedef long long llu;
typedef long double lld;
typedef pair<int,int> pi;
#define FastIO cin.sync_with_stdio(false),cin.tie(NULL)
#define ll        long long int
#define mod       (ll) 1000000007
#define pb        push_back
#define f(i,s,n)    for (int i=s;i<n;i++)
#define fb(i,s,n,b)    for (int i=s;i<n;i+=b)
#define frev(i,s,n) for(int i=s;i>n;i--)
#define vii       vector<int>
#define seti      set<int>
#define mapi      unordered_map<int,int>
#define mapv      map<int,vii>
#define vll       vector<ll>
#define vpp       vector<pp>
#define vss       vector<string>
#define lcm(a,b)    (a*b)/__gcd(a,b)
#define all(a)      a.begin(),a.end()
#define all(a)      a.begin(),a.end()
#define fo(i,a)       for(auto &i:a)
#define bs(v,x)     binary_search(all(v),x)
#define fast ios_base::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);srand(time(NULL))
#define sortrev(a) sort(a.begin(), a.end(), greater<pair<pair<int,int>,int>>());
#define vii2d       vector<vector<int>>
#define ms          multiset<int>
#define pairi       pair<int,int>
#define useti   unordered_set<int>
#define mp          make_pair
#define gcd(a,b)    __gcd(a,b) 
const int N=200005;
void solve()
{
    ll k,l,r,t,x,y;
    cin>>k>>l>>r>>t>>x>>y;
    if (x==y)
    {
        if ((k+y<=r)||(k-x>=l))
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
        return;
    }
    if (x>y)
    {
        if (k+y>r)
        {
            k-=x;
            t-=1;
        }
        if (k<l)
        {
            cout<<"NO"<<endl;
            return;
        }
        ll left=k-l;
        ll ne=left/(x-y);
        if (ne>=t)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    else
    {
        t-=(k-l)/x;
        k-=((k-l)/x)*x;
        if (t<=0)
        {
            cout<<"YES"<<endl;
            return;
        }
        if (k+y>r)
        {
            cout<<"NO"<<endl;
            return;
        }
        ll f=1;
        mapi d;
        while(t>0)
        {
            if (k+y<=r)
                k+=y;
            else
            {
                f=0;
                break;
            }
            t-=(k-l)/x;
            k-=((k-l)/x)*x;
            if (d[k%x]==1)
            {
                f=1;
                break;
            }
            d[k%x]=1;
        }
        if (f==1)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
}
int main()
{
    FastIO;
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1;
    int c=0;
    while(t--)
    {
      solve();
      c+=1;
    }
    return 0; 
}