#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

const int NMAX = 8200;

int N, M, X, Y, L[NMAX], R[NMAX], VCL[NMAX], VCR[NMAX];
vector<int> G[NMAX];
bool Used[NMAX];

bool PairUp(int Node)
{
    if(Used[Node]) return 0;
    Used[Node] = 1;

    for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
        if(!R[*it])
        {
            L[Node] = *it;
            R[*it] = Node;
            return 1;
        }

    for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
        if(PairUp(R[*it]))
        {
            L[Node] = *it;
            R[*it] = Node;
            return 1;
        }
    return 0;
}

void MaxMatching()
{
    bool OK = 1;
    while(OK)
    {
        OK = 0;
        memset(Used, 0, sizeof(Used));
        for(int i = 1; i <= N; ++ i)
            if(!L[i] && PairUp(i))
                OK = 1;
    }
}

void MinVertexCover(int Node)
{
    for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
        if(!VCR[*it])
        {
            VCR[*it] = 1;
            VCL[ R[*it] ] = 0;
            MinVertexCover(R[*it]);
        }
}

int main()
{
    freopen("felinare.in", "r", stdin);
    freopen("felinare.out", "w", stdout);

    scanf("%i %i", &N, &M);
    for(int i = 1; i <= M; ++ i)
    {
        scanf("%i %i", &X, &Y);
        G[X].push_back(Y);
    }

    MaxMatching();

    int Cnt = 0;
    for(int i = 1; i <= N; ++ i)
        if(L[i])
            Cnt ++, VCL[i] = 1;

    printf("%i\n", 2 * N - Cnt);
    for(int i = 1; i <= N; ++ i)
        if(!L[i])
            MinVertexCover(i);

    for(int i = 1; i <= N; ++ i)
    {
        if(VCL[i] && VCR[i]) printf("0\n");
        else if(!VCL[i] && VCR[i]) printf("1\n");
        else if(VCL[i] && !VCR[i]) printf("2\n");
        else printf("3\n");
    }
}