- The output should contain a single line with a single word
- The word should be YES if it is possible to partition the vertices of the input graph into at most K partitions which satisfy the constraints mentioned above and NO otherwise