There are N locations in a city that need to be connected with drone pathways to transfer medical aid during emergencies.

Each location needs to be connected with all the other $N-1$ locations.

Some of these pathways are already built, while the rest need to be constructed now.Due to the peculiarity of the technology used in the pathways, whenever new pathways from a location are constructed, all the pre-existing pathways from that location get destroyed.

For instance, if from location 4 drone pathways exist towards locations 1 & 2, but not towards location 3, then once you construct drone pathway from location 4 to location 3, the pre-existing pathways from location 4 to locations 1 & 2 get destroyed.The citizens of the city are eagerly awaiting "Complete Day", a day when drone pathways exist between all the locations in the city.

Every day they choose one of the N locations, and build all the missing pathways from that location, in the process destroying the pre-existing pathways.After doing this for a while, the citizens are now wondering if they will ever achieve Complete Day or not.

Can you help them by writing a program that can determine if Complete Day is possible or not, given the existing pathways among the N locations?

Read the input from STDIN and print the output to STDOUT. Do not write arbitrary strings anywhere in the program, as these contribute to the standard output and test cases will fail.

Constraints: 2 < N <= 1000, the number of locations

0 <e M <= N * (N - 1) / 2, the number of existing pathways

Input Format:

The first line of input for each test case contains the integer T, the total number of cities.For each city, the input is given as follows:The first line contains N, the number of locations in that city.

The locations are labeled 1 to $N$.The next line contains $M$, the number of current drone pathways.The next $M$ lines contain two numbers each, the labels of the locations that are currently connected.Output Format:The output for each city must contain "Complete Day" or "Not a Complete Day" depending on whether Complete Day can be achieved for that city or not.