#include <cstdio>

 using namespace std;

 const int maxn = ;

 int fa[maxn], visit[maxn], dis[maxn][maxn];

 struct node

 {

     int x, y;

 }node[maxn];

 //先预处理所有点间的距离

 void pre(int n, int d)

 {

     for(int i = ; i <= n; i++)

         for(int j = ; j <= n; j++)

         {

             int dx = node[i].x - node[j].x;

             int dy = node[i].y - node[j].y;

             if(dx*dx + dy*dy <= d*d)

                 dis[i][j] = ;

             else

                 dis[i][j] = ;

         }

 }

 void init(int n)

 {

     for(int i = ; i <= n; i++)

     {

         fa[i] = i;

         visit[i] = ;

     }

 }

 int found(int x)

 {

     if(fa[x] == x)

         return x;

     return fa[x] = found(fa[x]);

 }

 void unite(int x, int y)

 {

     int px = found(x);

     int py = found(y);

     if(px == py)

         return;

     else

         fa[px] = py;

 }

 int main()

 {

     int n, d, x, y;

     char opr;

     scanf("%d%d", &n, &d);

     init(n);

     for(int i = ; i <= n; i++)

         scanf("%d%d", &node[i].x, &node[i].y);

     pre(n, d);//pre要写在输入坐标之后!!!!不然dis就全是1!!!

     getchar();

     while(scanf("%c", &opr) == )

     {

         if(opr == 'O')

         {

             scanf("%d", &x);

             visit[x] = ;

             for(int i = ; i <= n; i++)

                 if(visit[i] && dis[x][i])//距离合适且修好了的就可以互相联络

                     unite(x, i);//能互相联络的都放一个集合里

         }

         else

         {

             scanf("%d%d", &x, &y);

             if(found(x) == found(y))

                 printf("SUCCESS\n");

             else

                 printf("FAIL\n");

         }

         getchar();

     }

     return ;

 }