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.*;
import java.lang.*;
import java.io.*;
import java.math.*;

public class practice {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
 
 
//   public long[] longArray(){
//         int size=sc.nextInt();
//           long arr[i]=new long[size];
//           for(int i=0;i<size;i++){
//               arr[i]=sc.nextLong();
//           } 
//long sum=0,temp=0;
//   }
//  public static void print (){
//      System.out.println()
//  }








    public static void main(String[] args) {
        FastReader sc = new FastReader();
       int t=sc.nextInt();
       for(int i=0;i<t;i++){
        String s=sc.next();
          //Deque<Character> de_que = new ArrayDeque<Character>(s.length());
        char[] arr=s.toCharArray();
        // for(int k=0;k<s.length();k++){
        //     de_que.add(arr[k]);
        // }
        //  System.out.println(de_que);
         
        //  while(!de_que.isEmpty()){
        //      if(de_que.peekFirst()>de_que.peekLast()){
                 
        //      }
        //  }
         boolean isd=false;
	   	  Map<Integer,Integer> list= new HashMap<>();
	     for(int ii=0;ii<arr.length;ii++){
	      if(list.containsKey((int)arr[ii])){
	          System.out.println("No");
	          isd=true;
	          break;
	      }else{
	           list.put((int)arr[ii],i);
	      }
	          
	    
	     }
	    
	      
      if(isd==false){
           int max=Math.max((int)arr[0],(int)arr[arr.length-1]);
         
        int j=0;
       
        while((int)arr[j]>(int)'a'){
          if(j+1<arr.length&&(int)arr[j]>(int)arr[j+1]){
              j++;
          }  
          else{
           
              System.out.println("No");
              isd=true;
              break;
          }
            
      }
      
      if(  isd==false){
              while(j<arr.length-1){
                if((int)arr[j]<(int)arr[j+1]){
                  j++;
          }  
          else{

              System.out.println("No");
                isd=true;
              break;
          }
        }  
      }
 
         if(isd==false){
             for(int ii=97;ii<=max;ii++){
                 if(!list.containsKey(ii)){
                   System.out.println("No");  
                   isd=true;
                   break;
                 }
             }
             if(isd==false)
            System.out.println("Yes"); 
         }
         
       }
             
             
      }   
        
             
             
             
  }
            
     
}