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.
/*package whatever //do not write package name here */

import java.io.*;
import java.util.*;

public class GFG {
    
   	public static void main (String[] args) {
		Scanner scn = new Scanner(System.in);
		int t = scn.nextInt();
		scn.nextLine();
		while(t-- > 0){
		    String str = scn.nextLine();
		    
		    int[] count = new int[26];
		    
		    if(str.length() > 26){
		        System.out.println("NO");
		        continue;
		    }
		    for(int i=0; i<str.length(); i++){
		        char ch = str.charAt(i);
		        count[ch - 'a']++;
		    }
		    
		    int tag = 0;
		    int first_0 = Integer.MAX_VALUE, last_1 = -1;
		    for(int i=0; i<26; i++){
		        
		        if(count[i] ==0){
		            if(first_0 == Integer.MAX_VALUE){
		                first_0 = i;
		            }
		        }
		        else if(count[i] == 1){
		            last_1 = i;
		        }
		        else{
		            tag = 1;
		            break;
		        }
		    }
		    
		    if(tag == 1  ||  first_0 < last_1){
		        System.out.println("NO");
		        continue;
		    }
		    
		    
		    int flag;
		    if(str.charAt(0) == 'a'){
		        flag = 1;
		    }
		    else{
		        flag = 0;
		    }
		    
		    for(int i=0; i<str.length()-1; i++){
		        
		        if(flag == 0){
		            char ch1 = str.charAt(i);
		            char ch2 = str.charAt(i+1);
		            if(ch1 < ch2){
		                tag = 1;
		                break;
		            }
		            
		            if(ch2 == 'a'){
		                flag = 1;
		            }
		        }
		        else{
		          //  System.out.println(i);
		            char ch1 = str.charAt(i);
		            char ch2 = str.charAt(i+1);
		            if(ch2 < ch1){
		                tag = 1;
		                break;
		            }
		        }
		    }
		    
		    if(tag == 1){
		        System.out.println("NO");
		    }
		    else{
		        System.out.println("YES");
		    }
		  
		}
	}
}