#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

const int max1 = 2e6;

int n, m;
vector <int> edge[max1 + 5];

int dfn[max1 + 5], low[max1 + 5], dfs_clock;
int s[max1 + 5], top;
bool in[max1 + 5];
int belong[max1 + 5], cnt;

void Tarjan ( int now )
{
    dfn[now] = low[now] = ++dfs_clock;
    s[++top] = now; in[now] = true;
    for ( auto v : edge[now] )
    {
        if ( !dfn[v] )
        {
            Tarjan(v);
            low[now] = min(low[now], low[v]);
        }
        else if ( in[v] )
            low[now] = min(low[now], dfn[v]);
    }

    if ( dfn[now] == low[now] )
    {
        int x; ++cnt;
        do
        {
            x = s[top--];
            in[x] = false;
            belong[x] = cnt;
        } while ( x != now );
    }
    return;
}

int main ()
{
    scanf("%d%d", &n, &m);
    for ( int i = 1, u, v, a, b; i <= m; i ++ )
    {
        scanf("%d%d%d%d", &u, &a, &v, &b);
        edge[u + n * (a ^ 1)].push_back(v + n * b);
        edge[v + n * (b ^ 1)].push_back(u + n * a);
    }

    for ( int i = 1; i <= n + n; i ++ )
        if ( !dfn[i] )
            Tarjan(i);
    
    // for ( int i = 1; i <= n + n; i ++ )
    //     printf("%d ", belong[i]);
    // printf("\n");
    
    for ( int i = 1; i <= n; i ++ )
        if ( belong[i] == belong[n + i] )
            return puts("IMPOSSIBLE"), 0;
    
    puts("POSSIBLE");
    for ( int i = 1; i <= n; i ++ )
        printf("%d ", belong[i] > belong[i + n]);
    printf("\n");
    return 0;
}