#include <algorithm>
#include <vector>
#include <bitset>
using namespace std;

#define pb push_back
#define DIM 8200

int l[DIM],r[DIM],sl[DIM],sr[DIM];
vector <int> g[DIM];
bitset <DIM> viz;
int n,m,cup;

void read ()
{
    int i,x,y;

    scanf ("%d%d",&n,&m);
    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d",&x,&y);
        g[x].pb (y);
    }
}

int pairup (int nod)
{
    vector <int> :: iterator it;

    if (viz[nod])
        return 0;
    viz[nod]=1;
    for (it=g[nod].begin (); it!=g[nod].end (); ++it)
        if (!r[*it])
        {
            r[*it]=nod;
            l[nod]=*it;
            return 1;
        }
    for (it=g[nod].begin (); it!=g[nod].end (); ++it)
        if (pairup (r[*it]))
        {
            r[*it]=nod;
            l[nod]=*it;
            return 1;
        }
    return 0;
}

void suport (int nod)
{
    vector <int> :: iterator it;

    for (it=g[nod].begin (); it!=g[nod].end (); ++it)
        if (!sr[*it])
        {
            sr[*it]=1;
            sl[r[*it]]=0;
            suport (r[*it]);
        }
}

void solve ()
{
    int i,ok;

    do
    {
        ok=0;
        viz.reset ();
        for (i=1; i<=n; ++i)
            if (!l[i] && pairup (i))
            {
                ok=1;
                ++cup;
            }
    }
    while (ok);
    printf ("%d\n",(n<<1)-cup);
    viz.reset ();
    for (i=1; i<=n; ++i)
        if (l[i])
            sl[i]=1;
    for (i=1; i<=n; ++i)
        if (!l[i])
            suport (i);
}

void print ()
{
    int i;

    for (i=1; i<=n; ++i)
        if (sl[i] && sr[i])
            printf ("0\n");
        else if (!sl[i] && sr[i])
            printf ("1\n");
        else if (sl[i] && !sr[i])
            printf ("2\n");
        else
            printf ("3\n");

}

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

    read ();
    solve ();
    print ();

    return 0;
}