#include<bits/stdc++.h>
using namespace std;
const int N=2e6+5;
int n,m,h[N],nx[N],b[N],tt,dfn[N],low[N],sjc,zhan[N],top,c[N],cnt;
bool pd[N];
void zj(int x,int y)
{
	b[++tt]=y;
	nx[tt]=h[x];
	h[x]=tt;
}
void tarjan(int x)
{
//	cout<<x<<endl; 
	dfn[x]=low[x]=++sjc;
	pd[x]=true;zhan[++top]=x;
	for(int i=h[x];i;i=nx[i])
	{
		int y=b[i];
		if(dfn[y]==0)
		{
			tarjan(y);
			low[x]=min(low[x],low[y]);
		}
		else if(pd[x])
		low[x]=min(low[x],dfn[y]);
	}
//		cout<<dfn[x]<<" "<<low[x]<<endl;// 
	if(dfn[x]==low[x])
	{
		++cnt;
		int z;
		do
		{
			z=zhan[top--];
			pd[z]=false;
			c[z]=cnt;
		}while(x!=z);
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		int x,pdx,y,pdy;
		scanf("%d%d%d%d",&x,&pdx,&y,&pdy);
		zj(x+(1^pdx)*n,y+pdy*n),zj(y+(1^pdy)*n,x+pdx*n);
	}
	for(int i=1;i<=2*n;i++)
	if(dfn[i]==0)
	tarjan(i);
	for(int j=1;j<=n;j++)
	{
		if(c[j]==c[j+n])
		{
//			cout<<j<<" "<<c[j];
			printf("IMPOSSIBLE");
			return 0;
		}
	}
	printf("POSSIBLE\n");
	for(int i=1;i<=n;i++)
	printf("%d ",c[i]>c[i+n]);
	return 0;
}