Problem of the Month, rung 04 Preview

Preview. This is December's Problem of the Month, open early so you can try it. The preview runs for one month, on its own graphs and its own board. On the 1st the board and every clock start empty, and nothing carries over. December starts with new graphs and an empty board.

Vertices: 5000, numbered 0 to 4999.
Each pair of vertices is joined with probability p = 1/2, each pair on its own.

The file. Lines starting with c describe the graph. Then a line p matrix n. Then n lines, one row of the adjacency matrix each. Row i (counting from 0) holds only the columns after i, from i+1 to n-1, four columns to a hex digit, the first column in the highest bit. A row's last digit is filled up with zero bits. The last row is empty.

Your answer. All n vertices in cycle order, each exactly once, separated by spaces or new lines. Each vertex must be joined to the next, and the last to the first. Any such cycle is accepted. Type it, or upload a text file, or a .gz or .tar.gz of that one file.