#include<cstdio>
#include<vector>
using namespace std;
vector<int>L[10100];
int n,m,i,j,a,b,ok,nr,v[10100],l[10100],r[10100],x[10100];
FILE *f,*g;
int cupl(int nod){
    v[nod] = 1;
    for(int i=0; i<L[nod].size(); i++){
        a = L[nod][i];
        if(!r[a]){
            r[a] = nod;
            l[nod] = a;
            return 1;
        }
    }
    for(int i=0;i <L[nod].size(); i++){
        a = L[nod][i];
        if( !v[r[a]] && cupl( r[a] ) ){
            r[a] = nod;
            l[nod] = a;
            return 1;
        }
    }
    return 0;
}
void supp(int nod){
    for(int i=0; i<L[nod].size(); i++){
        a = L[nod][i];
        if( !x[a] ){
            x[a] = 1;
            l[ r[a] ] = 0;
            supp( r[a] );
        }
    }
}
int main(){
    f=fopen("felinare.in","r");
    g=fopen("felinare.out","w");
    fscanf(f,"%d%d",&n,&m);
    for(i=1;i<=m;i++){
        fscanf(f,"%d%d",&a,&b);
        L[a].push_back(b);
    }
    do{
        ok=0;
        for(i=1;i<=n;i++){
            v[i]=0;
        }
        for(i=1;i<=n;i++){
            if( !l[i] && cupl(i) ){
                nr++;
                ok=1;
            }
        }
    }while(ok);
    for(i=1;i<=n;i++){
        if( l[i] == 0 )
            supp(i);
    }
    fprintf(g,"%d\n",2*n-nr);
    for(i=1;i<=n;i++){
        if( l[i] && x[i] )
            fprintf(g,"0\n");
        else if( !l[i] && x[i] )
            fprintf(g,"1\n");
        else if( l[i] && !x[i] )
            fprintf(g,"2\n");
        else
            fprintf(g,"3\n");
    }


    fclose(f);
    fclose(g);
    return 0;
}