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 
import java.util.*;
import java.io.*;

public class Problem_1217E {
    static List<Edge>[] map;
    static boolean[] used;
    static boolean[] visited;
    static int[] color;
    static int numOfColors = 1;

    static PrintWriter output = new PrintWriter(System.out);

    public static void main(String[] args) throws IOException {
        FastScanner input = new FastScanner(System.in);
        // PrintWriter output = new PrintWriter(System.out);

        int n = input.nextInt(), m = input.nextInt();
        map = new List[n];
        color = new int[m];
        used = new boolean[n];
        visited = new boolean[n];

        for (int i = 0; i < n; i++) {
            map[i] = new ArrayList<>();
            used[i] = false;
            visited[i] = false;
        }
        for (int i = 0; i < m; i++) {
            int u = input.nextInt(), v = input.nextInt();
            map[u - 1].add(new Edge(v - 1, i));
            color[i] = 1;
        }

        for (int i = 0; i < n; i++) {
            if (!used[i])
                DFS(i);
        }

        output.println(numOfColors);
        for (int i = 0; i < m - 1; i++)
            output.print(color[i] + " ");
        output.println(color[m - 1]);

        output.close();
    }

    static void DFS(int node) {
        used[node] = true;
        visited[node] = true;
        for (Edge edge : map[node]) {
            if (used[edge.u]) {
                if (visited[edge.u]) {
                    color[edge.index] = 2;
                    numOfColors = 2;
                }
            } else
                DFS(edge.u);
        }
        visited[node] = false;
    }

    static class Edge {
        public int u, index;

        public Edge(int u, int index) {
            this.u = u;
            this.index = index;
        }
    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        FastScanner(FileReader s) {
            br = new BufferedReader(s);
        }

        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        String nextLine() throws IOException {
            return br.readLine();
        }

        double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        long nextLong() throws IOException {
            return Long.parseLong(next());
        }
    }
}