#include<bits/stdc++.h>
#define int long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
struct node{
    int x,y;
};
bool operator < (node a,node b){
    return a.y*b.x<a.x*b.y;
}
int a[3],b[3],c[3];
inline void work(){
    cin>>b[0]>>c[0];
    fr(i,1,2) cin>>a[i]>>b[i]>>c[i];
    int l,r;
    l=ceil((double)(a[1]-b[0])/(c[1]-c[0])*(c[2]-c[0])+b[0]);
    r=floor((double)(b[1]-a[0])/(c[1]-c[0])*(c[2]-c[0])+a[0]);
    // cout<<l<<' '<<r<<endl;
    if(min(r,b[2])>=max(l,a[2])) puts("Yes");
    else puts("No");
}
inline void init(){
    while(cin>>a[0]) work();
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}