#include <bits/stdc++.h>
using namespace std;
struct jntm
{
	int x1,x2,y1,y2;
}boom[1005];
struct node
{
	int a,b,time,last;
	bool jdg;
}key[1005];
int main()
{
	int n,m,x,y;
	cin >> n >> m >> x >> y;
	int map[n + 1][m + 1];
	for(int i = 1;i <= n;i++)
		for(int j = 1;j <= m;j++)
			map[i][j] = 0;
	for(int i = 0;i < x;i++)
		scanf("%d %d %d %d",&boom[i].x1,&boom[i].x2,
		      &boom[i].y1,&boom[i].y2);
	for(int i = 0;i < y;i++)
	{
		scanf("%d %d",&key[i].a,&key[i].b);
		key[i].time = 0;
	}
	for(int i = 0;i < y;i++)
		for(int j = 0;j < x;j++)
			for(int k = boom[j].x1;k <= boom[j].x2;k++)
				for(int l = boom[j].y1;l <= boom[j].y2;l++)
				{
					if(k == key[i].a && l == key[i].b)
					{
						key[i].jdg = true;
						key[i].time++;
						key[i].last = j + 1;
					}
					else	key[i].jdg = false;
				}
	for(int i = 0;i < y;i++)
	{
		if(key[i].jdg == true)	printf("Y %d %d\n",key[i].time,key[i].last);
		else	printf("N\n");
	}
	return 0;
}