#include<iostream>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#include<math.h>
#include <numeric>
#include <random>
#include<map>
#include<queue>
#include<deque>
#include <bitset>
#include<stack>
#include<set>
#define int long long
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for (int i=0;i<(n);++i)
#define prep(i,n) for (int i=1;i<=(n);++i)
#define ep(i,j,n) for (int i=j+1;i<=(n);++i)
int INF = 900000000000000;
int mod=998244353;

signed main(){
  int n;cin>>n;
  double a,b,c,d,e,f;cin>>a>>b>>c>>d>>e>>f;
  double x,y;
  double p,q;if(b<d){q=d;}if(q<f){q=f;}
  double pp,qq;if(a<c){qq=c;}if(qq<e){qq=e;}
  if(b<d){p=b;}if(p>f){p=f;}
  if(a<c){pp=a;}if(pp>e){pp=e;}
  if(a==c && a==e){x=a;y=(p+q)/2;}
  else{
    if(b==d && d==f){
      x=(pp+qq)/2;y=b;
    }
    else{
    if(a==c){
    y=((e-a)*(a*a+b*b-c*c-d*d)-(c-a)*(a*a+b*b-e*e-f*f))/(2*(e-a)*(b-d)-2*(c-a)*(b-f));
    x=(2*(b-f)*y-a*a-b*b+e*e+f*f)/(2*(e-a));
  }
  else{
    y=((e-a)*(a*a+b*b-c*c-d*d)-(c-a)*(a*a+b*b-e*e-f*f))/(2*(e-a)*(b-d)-2*(c-a)*(b-f));
    x=(2*(b-d)*y-a*a-b*b+c*c+d*d)/(2*(c-a));
  }}
  }
  
  
  double r=(x-a)*(x-a)+(y-b)*(y-b);
  //cout<<x<<" "<<y<<endl;
  rep(i,n){
    double X,Y;cin>>X>>Y;
    if((x-X)*(x-X)+(y-Y)*(y-Y)<=r){cout<<"Yes"<<endl;}
    else{cout<<"No"<<endl;}
  }
}