Generalized traveling salesman problem instances. The first line in each file is the number of nodes (n), and the second line in each file is the number of clusters (m).

After that are n lines, each containing n space-separated distances. The jth entry on line i is the distance between i and j.

After that are m lines, the ith of which is a list of the nodes in group i. They are numbered from 0 to n-1.

The filenames are structured as #name#.txt. The first number is the number of clusters, and the second number is the number of vertices.