#include<cstdio>
#include<vector>
using namespace std;
vector<int>L[10100];
int n,m,i,j,a,b,r[10100],l[10100],v[10100],x[10100],nr,ok;
FILE *f,*g;
int cupl(int nod){
    v[nod] = 1;
    for(int i=0; i<L[nod].size(); i++){
        if( ! r[ L[nod][i] ] ){
            r[ L[nod][i] ] = nod;
            l[nod] = L[nod][i];
            return 1;
        }
    }
    for(int i=0; i<L[nod].size(); i++){
        if( !v[ r[ L[nod][i] ] ] && cupl ( r [ L[nod][i] ] ) ){
            r[ L[nod][i] ] = nod;
            l[nod] = L[nod][i];
            return 1;
        }
    }
    return 0;
}
void supp(int nod){
    for(int i=0; i<L[nod].size(); i++){
        if( !x[ L[nod][i] ] ){
            x[ L[nod][i] ] = 1;
            l[ r[ L[nod][i] ] ] = 0;
            supp( r[ L[nod][i] ] );
        }
    }
}
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);
    fprintf(g,"%d\n",2*n-nr);
    for(i=1; i<=n; i++){
        if( !l[i] )
            supp(i);
    }
    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;
}