# include <cstdio>
# include <vector>
# include <cstring>
# include <algorithm>
# define NR 10005
using namespace std;
vector <int> v[NR];
int i,j,n,m,cuplate,sol,x,y;
int M1[NR], M2[NR], ap[NR], leftMVC[NR], rightMVC[NR];
int match (int k)
{
    int i;
    if (ap[k]) return 0;
    ap[k]=1;
    for (i=0; i<v[k].size(); ++i)
        if (! M2[v[k][i]])
        {
            M1[k]=v[k][i]; M2[v[k][i]]=k;
            return 1;
        }

    for (i=0; i<v[k].size(); ++i)
        if (match(M2[v[k][i]]))
        {
             M1[k]=v[k][i]; M2[v[k][i]]=k;
             return 1;
        }
    return 0;
}
void f (int k)
{
    for(int i=0; i<v[k].size(); ++i)
        if(! rightMVC[v[k][i]])
        {
            rightMVC[v[k][i]] = 1;
            leftMVC[v[k][i]] = 0;

            f(M1[v[k][i]]);
        }
}
int main ()
{
    freopen ("felinare.in", "r", stdin);
    freopen ("felinare.out", "w", stdout);
    scanf ("%d%d", &n, &m);
    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d", &x, &y);
        v[x].push_back(y);
    }

    cuplate=1;
    while (cuplate)
    {
        cuplate=0;
        memset (ap, 0, sizeof(ap));
        for (i=1; i<=n; ++i)
            if (!M1[i]) cuplate+=match(i);
    }
    for (i=1; i<=n; ++i) if (M1[i]) ++sol;





    for(i=1; i<=n; ++i)
        if(M1[i]) leftMVC[i]=1;

    for(i=1; i<=n; ++i)
        if(! leftMVC[i]) f(i);


    printf("%d\n", 2*n - sol);
    for(i=1; i<=n; ++i) {
        if(leftMVC[i]==0 && rightMVC[i]==0) {
            printf("3\n");
            continue;
        }
        if(leftMVC[i]==0 && rightMVC[i]==1) {
            printf("1\n");
            continue;
        }
        if(leftMVC[i]==1 && rightMVC[i]==0) {
            printf("2\n");
            continue;
        }
        printf("0\n");
    }

    return 0;
}