#include <bits/stdc++.h>

using namespace std;

const int NMAX = 1e4;

vector <int> edges[2 * NMAX + 1];
int viz[2 * NMAX + 1];
int match[2 * NMAX + 1];

bool rematching( int node ) {
    viz[node] = 1;
    for ( auto it : edges[node] ) {
        int x = match[it];
        if ( x == 0 ) {
            match[node] = it;
            match[it] = node;
            return 1;
        }
        if ( !viz[x] && rematching( x ) ) {
            match[node] = it;
            match[it] = node;
            return 1;
        }
    }
    return 0;
}
int cuplaj( int n ) {
    int cnt = 0, sepoate = 1;
    while ( sepoate ) {
        sepoate = 0;
        for ( int i = 1; i <= n; i ++ ) {
            if ( !viz[i] && !match[i] && rematching( i ) ) {
                cnt ++;
                sepoate = 1;
            }
        }
        for ( int i = 1; i <= n; i ++ ) viz[i] = 0;
    }
    return cnt;
}
void dfs( int node, bool k ) {
    viz[node] = 1;
    if ( k == 0 ) {
        if ( !viz[match[node]] )
            dfs( match[node], 1 );
    } else {
        for ( auto it : edges[node] ) {
            if ( it != match[node] && !viz[it] )
                dfs( it, 0 );
        }
    }
}
int main() {
    ifstream fin( "felinare.in" );
    ofstream fout( "felinare.out" );
    int n, m, i, a, b;
    fin >> n >> m;
    for ( i = 0; i < m; i ++ ) {
        fin >> a >> b;
        edges[a].push_back( b + n );
        edges[b + n].push_back( a );
    }
    fout << 2 * n - cuplaj( n ) << '\n';
    for ( int i = 1; i <= n; i ++ ) if ( !match[i] && !viz[i] ) dfs( i, 1 );
    for ( int i = 1; i <= n; i ++ ) {
        if ( !viz[i] && viz[i + n] ) {
            fout << 0;
        } else if ( viz[i] && viz[i + n] ) {
            fout << 1;
        } else if ( viz[i] && !viz[i + n] )
            fout << 3;
        else
            fout << 2;
        fout << '\n';
    }
    return 0;
}