The format of each circular graph is:

n k
d1 d2 ... dk

where
n  - number of vertices
k  - number of distances, only those <= n/2 are listed
di - list of k distances

In 4 cases below the orders of maximum cliques are 2, 2, 2, 3
and orders of independent sets are 2, 3, 4, 3, respectively.

5 1
1

8 2
1 4

13 2
1 5

17 4
1 2 4 8