#include<bits/stdc++.h>

using namespace std;

int n,m;
int dfn[4000005];
int low[4000005];
int cnt;
int tot;
int times;
vector<int>edge[4000005];
bool ins[4000005];
int idx;
int bel[4000005];
stack<int>s;

void dfs(int u){
	s.push(u);
	ins[u]=1;
	dfn[u]=low[u]=++times;
	for(int i=0;i<edge[u].size();i++){
		if(!dfn[edge[u][i]]){
			dfs(edge[u][i]);
			low[u]=min(low[u],low[edge[u][i]]);
		}else if(ins[edge[u][i]]){
			low[u]=min(low[u],dfn[edge[u][i]]);
		}
	}
	if(low[u]==dfn[u]){
		idx++;
		do{
			bel[u]=idx;
			u=s.top();
			s.pop();
			ins[u]=0;
		}while(dfn[u]!=low[u]);
	}
}

int main(){
	scanf("%d",&n);
	scanf("%d",&m);int x,y;
		int xx,yy;
	for(int i=1;i<=m;i++){
		
		scanf("%d%d%d%d",&x,&xx,&y,&yy);
		if(xx==1&&yy==0){
			edge[x+n].push_back(y+n);
			edge[y].push_back(x);
		}else if(xx==1&&yy==1){
			edge[x+n].push_back(y);
			edge[y+n].push_back(x);
		}else if(xx==0&&yy==0){
			edge[x].push_back(y+n);
			edge[y].push_back(x+n);
		}else if(x==0&&y==1){
			edge[x].push_back(y);
			edge[y+n].push_back(x+n);
		}
	}
	for(int i=1;i<=n*2;i++){
		if(!dfn[i]){
			dfs(i);
		}
	}
	for(int i=1;i<=n;i++){
		if(bel[i]==bel[i+n]){
			printf("IMPOSSIBLE");
			return 0;
		}
	}
	puts("POSSIBLE");
	for(int i=1;i<=n;i++){
		if(bel[i]<bel[i+n]) printf("1 "); 
        else printf("0 ");
	}
	return 0;
}