#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <string>

 #include <algorithm>

 #include <cmath>

 #include <vector>

 #include <stack>

 #include <queue>

 #define ll long long

 using namespace std;

 const int maxn = ;

 int dx[maxn],dy[maxn];

 int f[maxn],vis[maxn];

 int n,d;

 int dis(int a,int b){

     int distance = (dx[a]-dx[b]) * (dx[a] - dx[b]) + (dy[a]-dy[b]) * (dy[a] - dy[b]);

     if(distance <= d*d)    return true;

     else    return false;

 }

 void init(int n){

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

         f[i] = i,vis[i] = ;

 }

 int find(int x){

     if(x == f[x])

         return x;

     return f[x] = find(f[x]);

 } 

 void join(int a, int b){

     a = find(a);

     b = find(b);

     if(a != b){

         f[a] = b;

     }

 }

 int main(){

     cin>>n>>d;

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

         cin>>dx[i]>>dy[i];

     }

     init(n);

     char ch;

     int num;

     int cnt = ;

     while(cin>>ch){

         if(ch == 'O'){

             cin>>num;

             num--;

             vis[cnt++] = num;

             for(int i = ; i < cnt-; i++){

                 if(vis[i] != num && dis(vis[i],num)){

                     join(vis[i],num);

                 }

             }

         }

         else{

             int p,q;

             cin>>p>>q;

             if(find(p-) == find(q-)){

                 cout<<"SUCCESS"<<endl;

             }

             else{

                 cout<<"FAIL"<<endl;

             }

         }

     }

     return ;

 }