#include<cmath>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int N = ;

const int M = ;

const double eps = 1e-;

template<typename T>

inline void read(T&x)

{

    T f = ,c = ;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){c=c*+ch-'';ch=getchar();}

    x = f*c;

}

int n,m,X[],Y[],ff[N];

double W,H;

int findff(int x){return x==ff[x]?x:ff[x]=findff(ff[x]);}

struct Tree

{

    double x,y,r;

    void rd(){scanf("%lf%lf%lf",&x,&y,&r);}

}t[N];

double sqr(double k){return k*k;}

double dis(int i,int j){return sqrt(sqr(t[i].x-t[j].x)+sqr(t[i].y-t[j].y));}

int tot;

struct Hole

{

    double k;

    int x,y;

    Hole(){}

    Hole(double k,int x,int y):k(k),x(x),y(y){}

}h[N*N];

bool cmp(Hole a,Hole b){return a.k<b.k;}

int ans[M];

struct Peo

{

    double r;

    int c,id;

    void rd(int i){scanf("%lf",&r),r*=;read(c),c--;id=i;}

}p[M];

bool vmp(Peo a,Peo b){return a.r<b.r;}

void merge(int x,int y)

{

    x = findff(x),y = findff(y);

    if(x!=y)ff[x]=y;

}

bool cX(){return findff(X[])==findff(X[]);}

bool cY(){return findff(Y[])==findff(Y[]);}

int Xi[]={,,,},Yi[]={,,,};

bool cC(int cn){return findff(X[Xi[cn]])==findff(Y[Yi[cn]]);}

void ot(int x)

{

    for(int i=;i<;i++)if(ans[x]&(<<i))

        putchar(''+i);

    puts("");

}

int main()

{

    read(n),read(m);

    scanf("%lf%lf",&W,&H);

    X[] = n+,X[] = n+,Y[] = n+,Y[] = n+;

    for(int i=;i<=n+;i++)ff[i]=i;

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

    {

        t[i].rd();

        h[++tot] = Hole(t[i].x-t[i].r,i,Y[]);

        h[++tot] = Hole(t[i].y-t[i].r,i,X[]);

        h[++tot] = Hole(W-t[i].x-t[i].r,i,Y[]);

        h[++tot] = Hole(H-t[i].y-t[i].r,i,X[]);

    }

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

        h[++tot] = Hole(dis(i,j)-t[i].r-t[j].r,i,j);

    for(int i=;i<=m;i++)p[i].rd(i);

    sort(p+,p++m,vmp),sort(h+,h++tot,cmp);

    for(int i=,j=;i<=m;i++)

    {

        while(h[j].k+eps<p[i].r&&j<=tot)

            merge(h[j].x,h[j].y),j++;

        bool cx = cX(),cy = cY();int cc = p[i].c;

        if(cC(cc)){ans[p[i].id]=(<<cc);continue;}

        if(cx&&cy)ans[p[i].id]=(<<cc);

        else if(cx&&!cy)ans[p[i].id]=((<<cc)|(<<(cc^)));

        else if(!cx&&cy)ans[p[i].id]=((<<cc)|(<<(cc^)));

        else ans[p[i].id]=;

        for(int cn=;cn<;cn++)

            if(cC(cn)&&(ans[p[i].id]&(<<cn)))ans[p[i].id]^=(<<cn);

    }

    for(int i=;i<=m;i++)ot(i);

    return ;

}