#include <bits/stdc++.h>
//#pragma GCC optimize ("03")
#define FastIO ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(0)
#define FILES freopen("felinare.in" , "r" , stdin) , freopen("felinare.out" , "w" , stdout)
#define ll long long
#define ull unsigned long long
#define ld long double
#define eb emplace_back
#define pb push_back
#define qwerty1 first
#define qwerty2 second
#define qwerty3 -> first
#define qwerty4 -> second
#define umap unordered_map
#define uset unordered_set
#define pii pair < ll , ll >
#define pq priority_queue
#define dbg(x) cerr << #x << ": " << x << '\n'

namespace FastRead
{
    char __buff[5000];ll __lg = 0 , __p = 0;
    char nc()
    {
        if(__lg == __p){__lg = fread(__buff , 1 , 5000 , stdin);__p = 0;if(!__lg) return EOF;}
        return __buff[__p++];
    }
    template<class T>void read(T&__x)
    {
        T __sgn = 1; char __c;while(!isdigit(__c = nc()))if(__c == '-')__sgn = -1;
        __x = __c - '0';while(isdigit(__c = nc()))__x = __x * 10 + __c - '0';__x *= __sgn;
    }
}

using namespace FastRead;
using namespace std;

const ll N = 9e3 + 10;
const ll M = 1e9 + 7;
const ld PI = acos(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n , m;
bool state[N][2];

struct MaxMatching
{
    #define N (int) 18e3 + 10

    int n1 , n2;
    int l[N] , r[N];
    vector < int > G[N];
    bool mark[N];

    MaxMatching(int n1 , int n2)
    {
        this -> n1 = n1;
        this -> n2 = n2;
    }

    void addEdge(int x , int y)
    {
        G[x].pb(y);
    }

    bool pair(int x)
    {
        if(mark[x])
            return 0;

        mark[x] = 1;

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

        for(auto i : G[x])
            if(pair(r[i]))
            {
                l[x] = i;
                r[i] = x;
                return 1;
            }

        return 0;
    }

    int maxmatch()
    {
        bool ok = 1;

        while(ok)
        {
            ok = 0;

            for(int i = 1 ; i <= n1 ; i++)
                mark[i] = 0;

            for(int i = 1 ; i <= n1 ; i++)
                if(!l[i])
                    ok |= pair(i);
        }

        int ans = 0;

        for(int i = 1 ; i <= n1 ; i++)
            ans += l[i] > 0;

        return ans;
    }
};

signed main()
{
	#ifndef ONLINE_JUDGE
		FastIO , FILES;
	#endif

	int i;

	cin >> n >> m;

    MaxMatching M(n , n);

	for(i = 1 ; i <= m ; i++)
    {
        int x , y;

        cin >> x >> y;
        M.addEdge(x , y + n);
    }

    for(i = 1 ; i <= n ; i++)
        state[i][0] = state[i][1] = 1;

    int f = M.maxmatch();

    cout << 2 * n - f << '\n';

    for(int i = 1 ; i <= n ; i++)
        if(M.l[i])
        {
            state[i][0] = 0;
            int to = M.l[i] - n;
            //state[to][1] = 0;
        }

    for(i = 1 ; i <= n ; i++)
        cout << state[i][0] + state[i][1] * 2 << '\n';

    return 0;
}