#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //required
// #include <ext/pb_ds/tree_policy.hpp> //required

// using namespace __gnu_pbds; 
using namespace std;

void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.st << ' ' << p.nd << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
// template <typename T> using ordered_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;  // ordered_set <int> s; // order_of_key(value)

#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"

#define st first
#define nd second

const int N = 9000;

int n, k, x,m,e,u,v, a, b, ok;
vector<int> vx[N],vy[N];
int viz[N], px[N], py[N];

bool dfs(int n)
{
	viz[n]=1;
	for (auto v: vx[n])
		if (py[v]==0||(!viz[py[v]]&&dfs(py[v])))
		{
			px[n]=v;
			py[v]=n;
			return true;
		}
		return false;
}

// const int N = ;

int main() {
	// ios_base::sync_with_stdio(false);

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

	cin >> n >> m;
	for(int i = 1; i <= m; i++) {
		cin >> a >> b;
		vx[a].push_back(b);
		vy[b].push_back(a);
	}

	ok = 1;
	while (ok) {
		
		ok = 0;
		memset(viz, 0, sizeof(viz));

		for (int i = 1; i <= n; i++)
			if (viz[i] == 0 && !px[i])
				ok += dfs(i);
	}

	int ans = n;
	for(int i = 1; i <= n; i++) 
		ans += (py[i] == 0);
		// ans += (px[i] != 0);
	cout << ans << '\n';
	for(int i = 1; i <= n; i++)
		cout << int(py[i] == 0) * 2 + 1 << '\n';
}