#include <fstream>

using namespace std;

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

int l[100001],r[100001],n,m,i,j,L,R,x,y;

int main()
{
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        l[x]++; /// cate drumuri iasa din nod;
        r[y]++; /// cate drumuri intra in nod;
    }
    for (i=1;i<=n;i++)
    {
        if (l[i]==0)
            L++; /// din cate noduri nu iasa nici o strada;
        if (r[i]==0)
            R++; /// in cate noduri nu intra nici o strada;
    }
    if (L>R) /// mai multe noduri din care nu iasa nici o strada;
    {
        fout<<n+L<<"\n";
        for (i=1;i<=n;i++)
        {
            if (l[i]>0)
                fout<<"2\n";
            else
                fout<<"3\n";
        }
    }
    else
    {
        fout<<n+R<<"\n";
        for (i=1;i<=n;i++)
        {
            if (r[i]>0)
                fout<<"1\n";
            else
                fout<<"3\n";
        }
    }
    return 0;
}