- The first line will contain two space-separated integers, N and K, where N is the number of nodes in the graph, and K is the input parameter as described in the rules 
- Vertices in the Graph are numbered starting from 0
- Each of the subsequent lines in the input represents the vertices connected to a particular vertex (in order i.e. line-2 has neighbours of vertex 0, line-3 for vertex 1 and so on). For example for a graph of size n, the second line in the input will have all the vertices (from (1-n-1)) connected to vertex 0
- Each line has space seperated integers