#include <fstream>
#include <vector>
#include <cstring>

#define maxn 8192

using namespace std;

ifstream fin("felinare.in");
ofstream fout("felinare.out");

int n,m,a,b,sw,l[maxn],r[maxn];
vector <int> G[maxn];
bool ok,viz[maxn],fel1[maxn],fel2[maxn];

bool find_augmenting_path(int node)
{
    if (viz[node]) return 0;
    viz[node]=1;

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

    for (vector<int>::iterator it=G[node].begin(); it!=G[node].end(); ++it)
    {
        if (find_augmenting_path(r[*it]))
        {
            r[*it]=node;
            l[node]=*it;
            return 1;
        }
    }

    return 0;
}

void max_independent_set (int node)
{
    if (fel1[node]) return;
    fel1[node]=1;

    for (vector<int>::iterator it=G[node].begin(); it!=G[node].end(); ++it)
    {
        if (*it!=l[node])
        {
            fel2[*it]=1;
            max_independent_set (r[*it]);
        }
    }
}

int main()
{
    fin>>n>>m;

    for (int i=1; i<=m; i++)
    {
        fin>>a>>b;
        G[a].push_back(b);
    }

    int matching=0;

    do
    {
        ok=0;
        memset (viz,0,n+1);
        for (int i=1; i<=n; i++)
        if (!l[i])
        {
            if (find_augmenting_path(i))
            {
                ++matching;
                ok=1;
            }
        }
    } while (ok);



    for (int i=1; i<=n; i++)
    {
        if (!l[i])
        {
            max_independent_set (i);
        }
    }

    for (int i=1; i<=n; i++) fel2[i]=1-fel2[i];

    fout<<2*n-matching<<"\n";

    for (int i=1; i<=n; i++)
    {
        if (fel1[i]==0 && fel2[i]==0) fout<<0;
        else if (fel1[i]>0 && fel2[i]==0) fout<<1;
        else if (fel1[i]==0 && fel2[i]>0) fout<<2;
        else fout<<3;
        fout<<"\n";
    }
    return 0;
}