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

	public class B{
			
		BufferedReader br;
		StringTokenizer st;
		
		public B(){ // constructor
			
			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;
		}
		
		static void sort(int[] arr){
			
	        int n = arr.length;
	        
	        Random rnd = new Random();
	        
	        for(int i = 0; i < n; ++i){
	        	
	            int tmp = arr[i];
	            int randomPos = i + rnd.nextInt(n - i);
	            arr[i] = arr[randomPos];
	            arr[randomPos] = tmp;
	        }
	        
	        Arrays.sort(arr);
	   }

		static int gcd(int a, int b) {
			if(b == 0) {
				return a;
			}
			return gcd(b, a % b);
		}
		
	public static void main(String[] args) throws Exception{
		
		B in = new B();
		PrintWriter out = new PrintWriter(System.out);
		
		// hard work will power dedication
		
		int test = in.nextInt();
		
		while(test-- > 0) {
			String str = in.next();
			int len = str.length();
			
			int idx_a = -1;
			
			for(int i = 0; i < len; i++) {
				if(str.charAt(i) == 'a') {
					idx_a = i;
					break;
				}
			}
			
			int l = idx_a - 1;
			int r = idx_a + 1;
			
			boolean ok = true;
			
			int k = 1;
			while(l >= 0 || r < len) {
				if(l >= 0 && r < len) {
					if(str.charAt(l) == (char)('a' + k)) {
						l--;
					}
					else if(str.charAt(r) == (char)('a' + k)) {
						r++;
					}
					else {
						ok = false;
						break;
					}
				}
				else if(l >= 0) {
					if(str.charAt(l) == (char)('a' + k)) {
						l--;
					}
					else {
						ok = false;
						break;
					}
				}
				else if(r < len) {
					if(str.charAt(r) == (char)('a' + k)) {
						r++;
					}
					else {
						ok = false;
						break;
					}
				}
				k++;
			}
			
			if(ok && idx_a != -1) {
				out.println("Yes");
			}
			else {
				out.println("No");
			}
		}
		
		out.flush();
		out.close();
	}
}