#include <cstdio>
#include <cstring>
#include <vector>

using namespace std;

vector <int> g[9000];
int l[9000],r[9000],u[9000],s[18000],n;


int pairup(int x)
{
    if (u[x]) return 0;
    unsigned int i;
    u[x]=1;
    for (i=0;i<g[x].size();++i)
        if (!r[g[x][i]])
        {
            l[x]=g[x][i];
            r[g[x][i]]=x;
            return 1;
        }
    for (i=0;i<g[x].size();++i)
        if (pairup(r[g[x][i]]))
        {
            l[x]=g[x][i];
            r[g[x][i]]=x;
            return 1;
        }
    return 0;
}

void build_support(int x)
{
    unsigned int i;
    for (i=0;i<g[x].size();++i)
        if (!s[g[x][i]])
        {
            s[g[x][i]+n]=1;
            s[r[g[x][i]]]=0;
            build_support(r[g[x][i]]);
        }
}

int main()
{
    int m,ok,sol=0,x,y,i;
    freopen("felinare.in","r",stdin);
    freopen("felinare.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    for (i=1;i<=m;++i)
    {
        scanf("%d %d\n",&x,&y);
        g[x].push_back(y);
    }
    for (ok=1;ok;)
    {
        ok=0;
        memset(u,0,sizeof(u));
        for (i=1;i<=n;++i)
            if (!l[i])
                ok|=pairup(i);
    }
    for (i=1;i<=n;++i)
        sol+=(l[i]>0);
    printf("%d\n",2*n-sol);
    for (i=1;i<=n;++i)
        if (l[i])
            s[i]=1;
    for (i=1;i<=n;++i)
        if (!l[i])
            build_support(i);
    for (i=1;i<=n;++i)
        printf("%d\n",(1-s[i+n])*2+(1-s[i]));
    return 0;
}