/**
 * Start at 12:33
 * End at 13:17
 * Problem: poj1584
 * Author: __560
 *
 */
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<math.h>

using namespace std;

const int maxn=1000100;
const int INF=(1<<28);
const double eps=0.00000001;

int n;
struct Point
{
    double x,y;
    friend double operator*(const Point A,const Point B)
    {
        return A.x*B.y-A.y*B.x;
    }
    friend Point operator-(const Point A,const Point B)
    {
        return {A.x-B.x,A.y-B.y};
    }
};
Point vert[maxn],peg;
double R;

bool convex_bag(Point*vert,int n) ///判断是否凸包
{
    for(int i=0;i<n;i++){
        if(((vert[(i+2)%n]-vert[(i+1)%n])*(vert[(i+1)%n]-vert[i]))*((vert[(i+3)%n]-vert[(i+2)%n])*(vert[(i+2)%n]-vert[(i+1)%n]))<-eps)
            return false;
    }
    return true;
}

bool isin(Point*vert,int n,Point peg) ///判断点是否在多边形内
{
    for(int i=0;i<n;i++){
        if(((vert[i]-peg)*(vert[(i+1)%n]-peg))*((vert[(i+1)%n]-peg)*(vert[(i+2)%n]-peg))<eps) return false;
    }
    return true;
}

double dist(Point A,Point B)
{
    return sqrt(pow(A.x-B.x,2)+pow(A.y-B.y,2));
}

bool contain_circle(Point*vert,int n,Point peg,double R) ///判断多边形是否内含或内切已知圆
{
    for(int i=0;i<n;i++){
        double Area=fabs((vert[(i+1)%n]-peg)*(vert[i]-peg));
        double d=Area/dist(vert[i],vert[(i+1)%n]);
        if(d<R-eps) return false;
    }
    return true;
}

int main()
{
    //freopen("out.txt","w",stdout);
    while(cin>>n,n>=3){
        cin>>R>>peg.x>>peg.y;
        for(int i=0;i<n;i++) scanf("%lf%lf",&(vert[i].x),&(vert[i].y));
        if(!convex_bag(vert,n)){
            printf("HOLE IS ILL-FORMED\n");
            continue;
        }
        if(!isin(vert,n,peg)){
            printf("PEG WILL NOT FIT\n");
            continue;
        }
        if(contain_circle(vert,n,peg,R)) printf("PEG WILL FIT\n");
        else printf("PEG WILL NOT FIT\n");
    }
    return 0;
}