//HighFlow
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <fstream>
#include <string.h>
#include <math.h>
#include <algorithm>
#define fcat(c) while (c!='\n') fscanf(f,"%c",&c)
#define cat(c) while (c!='\n') scanf("%c",&c)
#define For(i,st,dr,k) for (int i=(st);i<=(dr);i+=(k))
#define ll (long long)
#define kfl(i,j) (a[(i)][(j)].c-a[(i)][(j)].f)
using namespace std;
FILE *f,*g;
bool bf[9000][2];
bool ok[9000][2];
vector <int> a[2][9000];
struct cp{int val,ind,k;} v[18000];
int i,j,n,m,lim,x,y,sol,ax;


bool cmp(cp a, cp b)
{
    return (a.val<=b.val);
}

int main()
{
    f=fopen("felinare.in","r");
    g=fopen("felinare.out","w");

    fscanf(f,"%d%d",&n,&m);

    for (i=1;i<=n;i++)
    {
        v[i*2].ind=v[i*2-1].ind=i;
        v[i*2-1].k=0;
        v[i*2].k=1;
    }

    for (i=1;i<=m;i++)
    {
        fscanf(f,"%d%d",&x,&y);
        a[0][x].push_back(y);
        a[1][y].push_back(x);
        v[x*2-1].val++;
        v[y*2].val++;
    }

    stable_sort(v+1,v+2*n+1,cmp);
    for (i=1,lim=2*n;i<=lim;i++)
        if (!ok[v[i].ind][v[i].k])
        {
            sol++;
            ok[v[i].ind][v[i].k]=true;
            bf[v[i].ind][v[i].k]=true;


            ax=v[i].k==1?0:1;
            for (j=0;j<a[v[i].k][v[i].ind].size();j++)
                ok[a[v[i].k][v[i].ind][j]][ax]=true;
        }

    fprintf(g,"%d\n",sol);
    for (i=1;i<=n;i++)
        fprintf(g,"%d\n",bf[i][0]+2*bf[i][1]);


	return 0;
}