You are given a directed graph with n vertices and m directed edges without self-loops or multiple edges.

Let's denote the k-coloring of a digraph as following: you color each edge in one of k colors. The k-coloring is good if and only if there no cycle formed by edges of same color.

Find a good k-coloring of given digraph with minimum possible k.

Input

The first line contains two integers n and m (2 ≤ n ≤ 5000, 1 ≤ m ≤ 5000) — the number of vertices and edges in the digraph, respectively.

Next m lines contain description of edges — one per line. Each edge is a pair of integers u and v (1 ≤ u, v ≤ n, u ≠ v) — there is directed edge from u to v in the graph.

It is guaranteed that each ordered pair (u, v) appears in the list of edges at most once.

Output

In the first line print single integer k — the number of used colors in a good k-coloring of given graph.

In the second line print m integers c_1, c_2, ..., c_m (1 ≤ c_i ≤ k), where c_i is a color of the i-th edge (in order as they are given in the input).

If there are multiple answers print any of them (you still have to minimize k).

Examples

Input


4 5
1 2
1 3
3 4
2 4
1 4


Output


1
1 1 1 1 1 


Input


3 3
1 2
2 3
3 1


Output


2
1 1 2 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
const long long MOD = 1e9 + 7;
const double err = 1e-10;
const int N = 5e3 + 5;
int n, m;
vector<vector<int>> adj(N);
vector<bool> vis(N, 0);
vector<int> tsort;
void topsort(int u) {
  vis[u] = 1;
  for (auto v : adj[u]) {
    if (!vis[v]) {
      topsort(v);
    }
  }
  tsort.push_back(u);
}
void solve() {
  cin >> n >> m;
  vector<pair<int, int>> edges;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    edges.push_back({u, v});
  }
  bool f = 0;
  for (int i = 1; i < n + 1; i++) {
    if (!vis[i]) {
      topsort(i);
    }
  }
  reverse((tsort).begin(), (tsort).end());
  vector<int> pos(N);
  for (int i = 0; i < n; i++) {
    pos[tsort[i]] = i;
  }
  int mx = 0;
  vector<int> col(m);
  for (int i = 0; i < m; i++) {
    if (pos[edges[i].first] < pos[edges[i].second]) {
      col[i] = 1;
    } else {
      col[i] = 2;
    }
    mx = max(mx, col[i]);
  }
  cout << mx << endl;
  for (auto i : col) cout << i << ' ';
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int T = 1;
  while (T--) solve();
  return 0;
}
