#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int N=2e5+5;
vector<int>G[N];
int n,m,st[N],top;
bool vis[N];
inline void add(int u,int v){G[u].pb(v^1),G[v].pb(u^1);}
inline bool dfs(int x){
	if(vis[x^1]) return 0;
	if(vis[x]) return 1;
	vis[x]=1,st[++top]=x;
	for(auto v:G[x])
		if(!dfs(v)) return 0;
	return 1;
}
inline bool check(){
	for(int i=0;i<n*2;i+=2)
		if(!vis[i]&&!vis[i^1]){
			int tmp=top;
			if(!dfs(i)){
				while(top>tmp) vis[st[top--]]=0;
				if(!dfs(i^1)) return 0;
			}
		}
	return 1;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>m;
	for(int i=1,x,a,y,b;i<=m;++i)
		cin>>x>>a>>y>>b,add(((x-1)<<1)|(1-a),((y-1)<<1)|(1-b));
	if(!check()) return puts("IMPOSSIBLE"),0;
	cout<<"POSSIBLE\n";
	for(int i=1;i<2*n;i+=2) cout<<vis[i]<<" ";
}