From the list of edges to the adjacency matrix - 2#4767
A simple directed graph is described by a list of edges.
Your task is to output its representation as an adjacency matrix.
The first line of the input contains two integers: (1 \le N \le 100), representing the number of vertices, and (1 \le M \le N \cdot (N-1)/2), representing the number of edges. The following lines each contain a pair of numbers, specifying one edge of the graph.
Output the adjacency matrix of the graph.
Example 1