Questions
---------
Preparing a programming contest can be very exhausting.  There is an
ancient Chinese saying that one fool can ask so many questions that 
a hundred clever men cannot ever answer.  And during a programming 
contest, questions are asked by many clever students.

The judges of this programming contest have found a simple way to make 
its work easier.  We have invented a simple algorithm that will help us 
answer ALL your questions!  Moreover, this algorithm guarantees that 
the same questions will get the same answers (this would be hardly 
possible, if we would undertook such a task ourselves).  According to 
this algorithm one of the judges starts to delete characters of the 
question in the following order:

- Starting from the first character the judge counts out N-1 characters 
  (spaces, punctuation marks etc. are considered to be characters too) 
  and deletes the Nth character.
- If a string ends, the count continues from the beginning of the string.
- After deleting a character, the count restarts from the character that 
  would be the (N+1)-st in the previous count.
- If the last remaining character is a question-mark ("?") then the answer 
  to the question is "Yes".  If it is a space then the answer is "No". 
  Any other character will lead to "No comments" answer.

You should help the judges and write a program that will do a hard work 
of answering the questions.  The number N will be secret and will not 
be announced even after the end of the contest. However, in your program 
you should use N=1999.

For example, taking a string "Is it a good question?" (its length is 22) 
the characters will be counted in the following way: 
   "Is it a good question?Is it ... quest" 
and "i" will be deleted.  Then the count restarts from 
   "on?Is it..." 
etc., until "s" will be left (thus the answer is "No comment", as usual).

Input
-----
The first line consists of the number N of test cases, with 
1 <= N <= 100,000.  This line is followed by N lines, each 
describing a test case.  Each test case consists of a single 
line, consisting of C characters, with 1 <= C <= 5,000.

Output
------
Per test case, one line consisting of either Yes, No, or No comment.

Sample Input
------------
3
Do the judges of this programming contest use the algorithm described in this problem to answer my question?
At least, will anybody READ my question?
Is this unfair?

Sample Output
-------------
Yes
No
No comment