//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("felinare.in");
ofstream cout("felinare.out");
vector <int> v[8191*2+5],f[8191*2+5];
int viz[8191*2+5],st[8191*2+5],dr[8191*2+5],n,vi2[8191*2+5],s1[8191*2+5],s2[8191*2+5];
bool cup(int nod){
    if(viz[nod]==1)
        return 0;
    viz[nod]=1;
    for(auto u:v[nod]){
        if(dr[u]==0){
            st[nod]=u;
            dr[u]=nod;
            return 1;
        }
    }
    for(auto u:v[nod]){
        if(cup(dr[u])==1){
            st[nod]=u;
            dr[u]=nod;
            return 1;
        }
    }
    return 0;
}
void add(int a,int b){
    v[a].push_back(b+n);
}
int c1=0,c2=0;
void fa(int nod){
    for(auto u:f[nod]){
        if(s2[u]==0){
            s2[u]=1;
            s1[dr[u]]=0;
            fa(dr[u]);
        }
    }
}
int main()
{
    int m,a,b,cnt=0,prevcnt=0;
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>a>>b;
        f[a].push_back(b);
        add(a,b);
    }
    do{
        prevcnt=cnt;
        for(int i=1;i<=2*n;i++){
            viz[i]=0;
        }
        for(int i=1;i<=n;i++){
            if(st[i]==0){
                cnt+=cup(i);
            }
        }
    }while(cnt!=prevcnt);
    cout<<2*n-cnt<<"\n";
    for(int i=1;i<=n;i++){
        if(st[i]!=0){
            st[i]-=n;
            s1[i]=1;
        }
        dr[i]=dr[i+n];
    }
    for(int i=1;i<=n;i++){
        if(s1[i]==0){
            fa(i);
        }
    }
    for(int i=1;i<=n;i++){
        //st[u]
        //cout<<supp[i]<<" "<<supp[i+n]<<"\n";
        cout<<(1-s1[i])+2*(1-s2[i])<<"\n";
    }
    return 0;
}