LOJ 1196

#include <bits/stdc++.h>
// #include <iostream>
// #include <cstdio>
// #include <cstdlib>
// #include <algorithm>
// #include <cmath>
// #include <vector>
// #include <set>
// #include <map>
// #include <queue>
// #include <ctime>
// #include <cassert>
// #include <complex>
// #include <string>
// #include <cstring>
// #include <queue>
// #include <bitset>

using namespace std;

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")


#define ll              long long int
#define vi              vector< int >
#define vll             vector< ll >

#define sc              scanf
#define pf              printf
#define cspf(i)         pf("Case %d:\n", i)
#define spc             pf(" ")
#define line            pf("\n")

#define ff              first
#define ss              second
#define mp              make_pair
#define pb              push_back
#define ppb             pop_back
#define tp(v,j)         get<j>(v)
#define Log(b,x)        (log(x)/log(b))

#define FOR(i,x,y)      for(int i = int(x); i < int(y); i++)
#define ROF(i,x,y)      for(int i = int(x)-1; i >= int(y); i--)
#define clr(arr,x)      memset(arr, x, sizeof arr)
#define vout(v,sz)      for(int w=0;w<sz;w++){if(w) spc; cout<<v[w];}
#define all(v)          v.begin(), v.end()
#define rall(v)         v.rbegin(), v.rend()
#define unq(v)          sort(all(v)),(v).resize(unique(all(v))-v.begin())
#define fastIO          ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)

#define sc1(x)          sc("%d",&x)
#define sc2(x,y)        sc("%d %d", &x, &y)
#define sc3(x,y,z)      sc("%d %d %d", &x, &y, &z)
#define scl1(x)         sc("%lld",&x);
#define scl2(x,y)       sc("%lld %lld", &x, &y)
#define scf1(x)         sc("%lf",&x)
#define scf2(x,y)       sc("%lf %lf", &x, &y)

#define pf1(x)          pf("%d",x)
#define pf2(x,y)        pf("%d %d", x, y)
#define pf3(x,y,z)      pf("%d %d %d", x, y, z)
#define pfl1(x)         pf("%lld",x)
#define pfl2(x,y)       pf("%lld %lld",x,y)

#define MOD             (ll)(1e9)
#define MaxN            100001
#define inf             0x3f3f3f3f
#define PI              acos(-1.0)  // 3.1415926535897932
#define eps             1e-9

template <class T> inline T bigMod(T p,T e,T M){T ret=1; for(;e>0;e>>=1){ if(e&1) ret=(ret*p)%M; p=(p*p)%M;} return (T)ret;}
template <class T> inline T modInverse(T a,T M){return bigMod(a,M-2,M);}
template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}
template <class T> inline T SQR(T a){return a*a;}

int dx[] = { 1,-1, 0, 0};
int dy[] = { 0, 0, 1,-1};

struct PT{
    ll x,y;
    void scan(){ scanf("%lld %lld",&x,&y);}
    void prnt(){ printf("%lld %lld\n",x,y);}
}ar[MaxN];

ll SQ(ll x){ return x*x;}

ll Dis(PT a,PT b){ return SQ(a.x-b.x) + SQ(a.y-b.y);}

long double absDis(PT a,PT b){ return sqrt((long double)Dis(a,b));}

// ll orientation(PT a,PT b,PT c){ return (b.y-a.y)*(c.x-b.x)-(b.x-a.x)*(c.y-b.y);}

ll AreaOfTri(PT a, PT b, PT c)
{
    ll area = 0;
    area += a.x * b.y - b.x * a.y;
    area += b.x * c.y - c.x * b.y;
    area += c.x * a.y - a.x * c.y;
    return area; //positive anticlockwise, negative clockwise
}

PT f; //init first coordinate
//for anti-clockwise sorting
bool AClockCmp(PT &a,PT &b){ return (f.x-a.x)*(f.y-b.y)>(f.x-b.x)*(f.y-a.y);}

//find the highets point lower then f_p
int bslo(int lo, int hi, PT p){
    if(lo>hi) return -1;
    int mid = (lo+hi)/2;
    ll ori = AreaOfTri(f, ar[mid], p);
    if(ori >= 0) return max(mid, bslo(mid+1, hi, p));
    return bslo(lo, mid-1, p);
}

//check if p lies in segment a_b
bool insegment(PT a, PT b, PT p){
    long double dis = absDis(a, b);
    long double dis1 = absDis(a, p);
    long double dis2 = absDis(p, b);
    return abs(dis - (dis1 + dis2)) <= eps;
}


int main(){

    #ifndef ONLINE_JUDGE
        clock_t tStart = clock();
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    int t, ca=0; sc1(t);

    while(t--){
        int n; sc1(n);
        FOR(i,0,n) ar[i].scan();
        f = ar[0];
        //sort(ar, ar+n, AClockCmp);

        cspf(++ca);

        int q; sc1(q);

        while(q--){
            PT p;
            p.scan();

            int inx = bslo(0, n-1, p);

            if(inx==-1) pf("n\n");
            else if(inx == n-1){
                if(insegment(f, ar[inx], p)) pf("y\n");
                else pf("n\n");
            }
            else{
                //check if point is inside the f_inxlo_inxhi triangle
                ll ori = AreaOfTri(ar[inx], ar[inx+1], p);
                if(ori>=0) pf("y\n");
                else pf("n\n");
            }
        }
    }


    #ifndef ONLINE_JUDGE
        fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    #endif

    return 0;
}