- The output should contain a single line with a single word
- The word should be YES if it is possible to colour the vertices of the graph using at most K colours and satisfy the constraints mentioned above and NO otherwise