#include <bits/stdc++.h>
using namespace std;
#define for0(i, n) for(int i = 0; i < n; i++)
#define for1(i, n) for(int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define index INDEX
#ifdef _WIN32
#include <windows.h>
#define print(x) PRINT(x, #x)
template<typename T> inline const void PRINT(T VARIABLE, string NAME)
{
#ifndef ONLINE_JUDGE /// ONLINE_JUDGE IS DEFINED ON CODEFORCES
    HANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);
    SetConsoleTextAttribute(hConsole, 10);
    cerr << NAME << " = " << VARIABLE;
    SetConsoleTextAttribute(hConsole, 7);
    cerr << '\n';
#endif
}
#else
#define print(x) 0
#endif
typedef long long ll;
typedef unsigned long long ull;
const ll INFLL = 2 * (ll)1e18 + 100;
const int INFINT = 2 * (int)1e9 + 100;
const double PI = atan(1) * 4;
const double EPS = 1e-9;
const int SEED = 137;

const int MOD = 1e9 + 7; /// careful here (7 or 9, 66.. etc)25000033
const int NMAX = 8191 + 5;

int n, m;
V graf[NMAX];

int l[NMAX], r[NMAX];
bool trecut[NMAX];
inline bool pair_up(int nod)
{
    if(trecut[nod]) return 0;
    trecut[nod] = 1;

    for(auto i: graf[nod]) if(!r[i])
        {
            l[nod] = i;
            r[i] = nod;
            return 1;
        }

    for(auto i: graf[nod]) if(pair_up(r[i]))
        {
            l[nod] = i;
            r[i] = nod;
            return 1;
        }

    return 0;
}

bool trecut_l[NMAX], trecut_r[NMAX];
struct mlc
{
    int val;
    char dir;

    bool operator < (mlc aux) const
    {
        if(aux.val == val) return dir < aux.dir;
        return aux.val < val;
    }
};
map<mlc, vector<mlc>> bipartite_graf;

void dfs(mlc nod)
{
   // cerr << nod.val << ' ' << nod.dir << '\n';
    if(nod.dir == 'l') trecut_l[nod.val] = 1;
    else trecut_r[nod.val] = 1;

    for(auto i: bipartite_graf[nod])
    {
        bool verif = 0;
        if(i.dir == 'l') verif |= trecut_l[i.val];
        else verif |= trecut_r[i.val];
        if(verif) continue;
        dfs(i);
    }
}

int sol[NMAX];

int main()
{
    ifstream cin("felinare.in");
    ofstream cout("felinare.out");
    cin >> n >> m;
    for1(i, m)
    {
        int a, b;
        cin >> a >> b;
        graf[a].pb(b);
    }

    for(;;)
    {
        bool ok = 0;
        memset(trecut, 0, sizeof(trecut));
        for1(i, n) if(!l[i]) ok |= pair_up(i);
        if(!ok) break;
    }

    for1(i, n)
    {
        for(auto it: graf[i])
        {
            if(l[i] == it)
            {
                mlc L;
                L.val = i;
                L.dir = 'l';
                mlc R;
                R.val = l[i];
                R.dir = 'r';
                bipartite_graf[R].pb(L);
            }
            else
            {
                mlc L;
                L.val = i;
                L.dir = 'l';
                mlc R;
                R.val = it;
                R.dir = 'r';
                bipartite_graf[L].pb(R);
            }
        }
    }

    for1(i, n) if(!trecut_l[i] && !l[i])
    {
        mlc temp;
        temp.val = i;
        temp.dir = 'l';
        dfs(temp);
    }

    for1(i, n)
    {
       // cerr << i << ' ' << l[i] << '\n';
        if((trecut_l[i] && l[i]) || (!l[i]))
            sol[i]++;
        if((!trecut_r[i] && r[i]) || (!r[i]))
            sol[i] += 2;
    }

    int cnt = 0;
    for1(i, n) if(sol[i] == 1 || sol[i] == 2) cnt++;
    else if(sol[i] == 3) cnt += 2;

    cout << cnt << '\n';
    for1(i, n)
    {
        cout << sol[i] << '\n';
    }

    return 0;
}