#include<iostream>
#include<algorithm>
using namespace std;
long long  m,n,ans;
struct re
{
    long long x1,y1,x2,y2;
};
re q[2001];
struct gj
{
    long long x,y;int cs,ls;
    bool sf;
};
gj p[2001];
int main()
{
	cin>>m>>n;
	for(int i=1;i<=m;i++)
	{
	    cin>>q[i].x1>>q[i].y1>>q[i].x2>>q[i].y2;
	}
	for(int i=1;i<=n;i++)
	{
	    cin>>p[i].x>>p[i].y;
	}
for(int i=1;i<=n;i++)
{
    p[i].cs=0;
    p[i].sf=false;
    for(int j=1;j<=m;j++)
    {
        if(p[i].x >= q[j].x2 && p[i].x <= q[j].x1 && p[i].y >= q[j].y1 && p[i].y <= q[j].y2)
        {
            p[i].sf=true;
            p[i].ls=j;
            p[i].cs++;
        }
    }
}
	for(int i=1;i<=n;i++)
	{
	    if(p[i].sf==false)
	    {
	        cout<<"NO"<<endl;
	        continue;
	    }
	    else
	    {
	        cout<<"YES"<<" "<<p[i].cs<<" "<<p[i].ls<<endl;
	    }
	}
	return 0;
}
```输出只有NO