The incidence matrix
Vertex of the graph u is incident to edge e, if u is one of the endpoints of edge e.
Similarly, an edge e is incident vertex u, if one end of the e - is the pinnacle of u.
The incidence matrix of a graph G=(V, E) is a rectangular table of |V| rows and |E| columns, where at the intersection of the i-th row and j-th column written one if vertex i is incident to edge j, and zero otherwise.
Given an undirected graph. Bring it the incidence matrix.
Input
The first line of the input file are given numbers N and M are separated by a space - the number of vertices and edges in the graph, respectively (1 ≤ N ≤ 1000, 0 ≤ M ≤ 10000). The next M lines contain two numbers u_i and v_i in space (1 ≤ u_i, v_i ≤ N); each such line means that there is an edge in the graph between the vertices u_i and v_i. The ribs are numbered in the order in which they are given in the input file, starting with one.
Output
Derive the output file N lines of M numbers each. j-th element of the i-th row must be equal to unity if vertex i is incident to edge j and zero otherwise. Separate adjacent row elements with a single space.