A string s of length n (1 ≤ n ≤ 26) is called alphabetical if it can be obtained using the following algorithm:

  * first, write an empty string to s (i.e. perform the assignment s := ""); 
  * then perform the next step n times; 
  * at the i-th step take i-th lowercase letter of the Latin alphabet and write it either to the left of the string s or to the right of the string s (i.e. perform the assignment s := c+s or s := s+c, where c is the i-th letter of the Latin alphabet). 



In other words, iterate over the n first letters of the Latin alphabet starting from 'a' and etc. Each time we prepend a letter to the left of the string s or append a letter to the right of the string s. Strings that can be obtained in that way are alphabetical.

For example, the following strings are alphabetical: "a", "ba", "ab", "bac" and "ihfcbadeg". The following strings are not alphabetical: "z", "aa", "ca", "acb", "xyz" and "ddcba".

From the given string, determine if it is alphabetical.

Input

The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.

Each test case is written on a separate line that contains one string s. String s consists of lowercase letters of the Latin alphabet and has a length between 1 and 26, inclusive.

Output

Output t lines, each of them must contain the answer to the corresponding test case. Output YES if the given string s is alphabetical and NO otherwise.

You can output YES and NO in any case (for example, strings yEs, yes, Yes and YES will be recognized as a positive answer).

Example

Input


11
a
ba
ab
bac
ihfcbadeg
z
aa
ca
acb
xyz
ddcba


Output


YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
NO

Note

The example contains test cases from the main part of the condition.
import java.util.Scanner;
public class B2 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        
        char[] alp = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
        String s  = "";
        char[] chr , cha;
        int t = scan.nextInt();
        int count = 0;
        int ai = 0;
        int al = -1;
        int ar = -1;
        int ac = 0; //Check existance of 'a'
        
        x:
        while(t-->0){
            
            s = scan.next();
            int l = s.length();
            chr = s.toCharArray();
            for(int i=0;i<l;i++){
                
                if(chr[i]=='a'){
                    ai = i;
                    ac = 1;
                    break;
                } 
                
            }
            
            if(ac == 0) {
                
                System.out.println("No");
                continue x;
            }
            ac = 0;
            al = -1;
            ar = -1;
            for(int i=1;i<l;i++){
                
                for(int j=0;j<l;j++){
                    
                    if(i==1){
                        
                        if(chr[j]==alp[i]){
                            
                            if(j<ai) al = j;
                            else ar = j;
                            
                            ac = 1;
                            break;
                            
                        }
                        
                    }else{
                        
                        
                        if(chr[j]==alp[i]){
                            
                            if((j<ai && j>al && al!=-1) || (j>ai && j<ar && ar!=-1)){
                                
                                System.out.println("No");
                                continue x;
                                
                            }else{
                                
                                if(j<ai) al = j;
                                else ar = j;
                                
                                ac = 1;
                                break;
                                
                            }
                            
                        }
                        
                    }
                    
                }
                if(ac==0){
                    System.out.println("No");
                    continue x;
                }
                ac = 0;
            }
            
            
            System.out.println("Yes");
            ac = 0;
            
  
        }  
    } 
}
