#include <algorithm>
#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
#include <stack>
#include <cmath>
// #include <bits/stdc++.h>
#define in  fin
#define out fout

using namespace std;

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

int cuplaj[17000];
vector<int> g[17000];
bool mr[17000];
bool in_mvc[17000];

bool pair_up(int nod){
    if(mr[nod]) return 0;
    mr[nod] = 1;

    for(const int &cop : g[nod]){
        if(!cuplaj[nod] || pair_up(cuplaj[cop])){
            cuplaj[nod] = cop;
            cuplaj[cop] = nod;
            return 1;
        }
    }

    return 0;
}

void mvc(int nod){ // minimum vertex cover
    for(const int &cop : g[nod]){
        if(!in_mvc[cop]){
            in_mvc[cop] = 1;
            in_mvc[ cuplaj[cop] ] = 0;

            mvc( cuplaj[cop] );
        }
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    in.tie(NULL);

    int n, m; in >> n >> m;

    for(int i = 0; i < m; i++){
        int a, b; in >> a >> b;
        g[a].push_back(b + n);
    }

    bool mai_bine = 1;
    while(mai_bine){
        mai_bine = 0;
        for(int i = 1; i <= n; i++) mr[i] = 0;
        for(int i = 1; i <= n; i++){
            if(pair_up(i)){
                mai_bine = 1;
            }
        }
    }

    for(int i = 1; i <= n; i++){
        if(cuplaj[i]) in_mvc[i] = 1;
    }

    for(int i = n + 1; i <= 2 * n; i++){
        if(!cuplaj[i]) mvc(i);
    }

    int cnt = 0;
    for(int i = 1; i <= 2 * n; i++){
        cnt += (in_mvc[i] == 0);
    }

    out << cnt << '\n';
    for(int i = 1; i <= n; i++){
        if(in_mvc[i] && in_mvc[i + n]) out << "0\n";
        if(!in_mvc[i] && in_mvc[i + n]) out << "1\n";
        if(in_mvc[i] && !in_mvc[i + n]) out << "2\n";
        if(!in_mvc[i] && !in_mvc[i + n]) out << "3\n";
    }

    return 0;
}