采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示：



Input Format:

第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数

第二行输入各顶点的信息，即输入每个顶点字符

第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行

Output format:

首先输出图的顶点信息，输出完毕换行

接着输出图的邻接矩阵，假如图中有n个顶点，则输出形式为n行n列的邻接矩阵，输出完毕换行

接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行

最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行

-Using an undirected graph adjacency matrix representation to complete the map creation, graph depth-first traversal, graph breadth-first traversal operation. In which vertex information is character, the graph vertex number by characters in order. The input sample used in the diagram are as follows:



Input Format:

The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges

Second row, enter information in each vertex, that enter each vertex character

Start typing in the third line of each side, each side in the form of two vertices of the serial number, in the middle separated by a space, enter the End of an edge wrap

Output format:

First, the output vertex information, the output has finished wrapping

Then the output graph adjacency matrix, if the graph has n vertices, then the output of the form n rows n columns of the adjacency matrix, the output has finished wrapping

The next line of output from the