Time Limit: 1000 MS    Memory Limit: 65536 K 


Description

huangshenno1 always wants to bring some welfare to others. So he decided to put a water problem into the contest. Given a string consisting of n (maybe 1-1000) only uppercase letters. if the string is in ascending order, print a line with "Yes", else print a line with "No". Ascending order means for every letter C_i (i > 0, based on 0), C_i >= C_i-1 in ASCII.

Input

The first line is a integer T, which means the total number of cases. Then next T lines, each line is a string consisting of only uppercase letters, whose length is (1-1000).

Output

if the string is in ascending order, print a line with "Yes", else print a line with "No".

Sample Input

4 A ACM ICPC SCU

Sample Output

Yes Yes No No

Author

huangshenno1