#include<algorithm>
#include<cstdio>
using namespace std;
int n,m,v[200001],kx,ky[200001],num=1;
struct node{
	int x,y,i;
}a[200001];
bool ans[100001];
bool cmp(node x,node y)
{
	return x.x!=y.x?x.x<y.x:x.y!=y.y?x.y<y.y:x.i<y.i;
}
bool cmp2(node x,node y)
{
	return x.y!=y.y?x.y<y.y:x.x<y.x;
}
int find(int x)
{
	int v=0;
	while(x)
		v+=ky[x],x-=x&-x;
	return v;
}
void insert(int x)
{
	if(find(x)==find(x-1))
		while(x<=num)
			++ky[x],x+=x&-x;
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)
		scanf("%d%d",&a[i].x,&a[i].y);
	for(int i=1;i<=m;++i)
		scanf("%d%d",&a[i+n].x,&a[i+n].y),a[i+n].i=i;
	sort(a+1,a+n+m+1,cmp2);
	a[0].y=1;
	for(int i=1,lst=0;i<=n+m;++i)
	{
		if(a[i].y!=lst)
			v[++num]=lst=a[i].y;
		a[i].y=num;
	}
	sort(a+1,a+n+m+1,cmp);
	for(int i=1,lst=-1,lss=0;i<=n+m;++i)
		if(a[i].i)
			if(!a[lss].i&&a[lss].x==a[i].x)
				ans[a[i].i]=a[lss].y==a[i].y;
			else
			{
				int j=find(a[i].y);
				if(j==find(a[i].y-1))
					ans[a[i].i]=a[i].x-kx==v[a[i].y]-j;
			}
		else
		{
			lss=i;
			int xx=a[i].x-kx,yy=v[a[i].y]-find(a[i].y);
			if(xx<yy)insert(a[i].y);
			else if(xx>yy&&a[i].x!=lst)++kx,lst=a[i].x;
		}
	for(int i=1;i<=m;++i)puts(ans[i]?"LOSE":"WIN");
}