Problem: 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 

Solution (in PYTHON3):

Solution:

# Para revisar la correctitud pueden probar el codigo en el codeforce que va a dar accepted

#recorrido del DFS pintando con color 2 a las aristas de retroceso y guardando si existe o no ciclo
def DFS(x, color, adyacentes, solucion):
    color[x] = 1  # nodo gris
    c = False
    for y, i in adyacentes[x]:
        # el adyacente es blanco
        if color[y] == 0:
            c = DFS(y, color, adyacentes, solucion) or c
        elif color[y] == 1:
            solucion[i] = 2
            c = True
    color[x] = 2  # nodo negro
    return c


def ColoringEdges():
    # recibiendo la entrada
    n, m = map(int, input().split())
    adyacentes = [[] for _ in range(0, n)]
    for i in range(0, m):
        u, v = map(lambda x: int(x)-1, input().split())
        adyacentes[u].append((v, i))

    color = [0]*n
    solucion = [1]*m
    c = False
    for r in range(0, n):
        if color[r] == 0:
            c = DFS(r, color, adyacentes, solucion) or c
    # como hay ciclos hay que usar dos colores en cada ciclo
    print(2 if c else 1)
    print(*solucion, sep=" ")


ColoringEdges()

# Casos de prueba
# 1--
# 4 5
# 1 2
# 1 3
# 3 4
# 2 4
# 1 4
# No hay ciclos

# 2--
#
# 3 3
# 1 2
# 2 3
# 3 1
# Hay un ciclo

# 3--
# 11 12
# 1 8
# 2 5
# 3 7
# 4 6
# 5 3
# 6 10
# 7 8
# 7 2
# 8 11
# 8 9
# 9 1
# 11 3
# Hay tres ciclos por lo q hay tres aristas de retroceso

# El codigo da accepted en CODEFORCE por lo que se puede probar
# con cualquier otro caso de prueba de los que se presentan ahi