From adjacency list to adjacency matrix

A simple directed graph is given as an adjacency list. Output its representation as an adjacency matrix.

\InputFileThe first line contains the number of vertices $n$ (1 \leq n \leq 100). Each of the following $n$ lines describes the outgoing edges from the $i$-th vertex. Each line begins with the number of outgoing edges, followed by the numbers of the vertices those edges point to. Vertices are numbered from $1$ to $n$.

\OutputFileOutput the adjacency matrix of the directed graph.