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.util.*;

public class answer {

	static Scanner s=new Scanner(System.in);
	static long mod=1000000007;
//	static boolean[] visited;
//	static ArrayList<Integer>[] edges;
//	static long[] ans;
//	static long[] weights;
	
	public static void main(String[] args)  {
		
		int testcases=s.nextInt();
		while(testcases-->0) {
			String ss=s.next();
			int n=ss.length();
			int ind=-1;
			for(int i=0;i<n;i++) {
				if(ss.charAt(i)=='a') {
					ind=i;
					break;
				}
			}
			
			if(ind==-1) {
				System.out.println("NO");
				continue;
			}
			
			int i=ind-1;
			int j=ind+1;
			int count=1;
			boolean ans=true;
			
			while(i>=0 || j<n) {
				char ch=(char)('a'+count);
				count++;
				if(i>=0 && ss.charAt(i)==ch) {
					i--;
				}else if(j<n && ss.charAt(j)==ch) {
					j++;
				}
				else {
					ans=false;
					break;
				}
			}
			
			
			
			
			if(ans) {
				System.out.println("YES");
			}else {
				System.out.println("NO");
			}
			
			
		}
			
		}
	
	 
		
	
	
	
	


	static int gcd(int a, int b)

    {
        // Everything divides 0
        if (a == 0)
          return b;
        if (b == 0)
          return a;
      
        // base case
        if (a == b)
            return a;
      
        // a is greater
        if (a > b)
            return gcd(a-b, b);
        return gcd(a, b-a);
    }
	
	public static long pow(long a,long b){
		long ans=1;
		if(a==0)return 1;
		for(int i=0;i<b;i++) {
			ans*=a;
			ans%=mod;
		}
		return ans;
		
	}
	

}
