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.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.time.LocalTime;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;


public class B {
	

	public static void main(String[] args) {
    	FastScanner scan = new FastScanner();
    	//PrintWriter out = new PrintWriter(System.out);
    	
    	int T = 1;
    	T = scan.nextInt();
    		for(int tt=0; tt<T; tt++) {
    			char [] ch = scan.next().toCharArray();
    			int n = ch.length;
    			
    			int [] a = new int[26];
    			int index = 0;
    			for(char c = 'a'; c <= 'z'; c++) {
    				a[index++] = c;
    			}
    				
    			int p1 = -1, p2 = -1;
    			for(int i=0; i<n; i++) {
    				if(ch[i] == 'a') {
    					p1 = i-1; 
    					p2 = i+1;
    				}
    			}
    			
    			
    			index = 1;
    			boolean works = false;
    			
    			if(p2 != -1) {
    			while(true) {
    				boolean has = false;
    				if(p1 < 0 && p2 >= n) {
    					works = true;
    					break;
    				}
    				
    				if(p1 >= 0 && ch[p1] == a[index]) {
    					index++;
    					p1--;
    					has = true;
    				}
    				else if(p2 < n && ch[p2] == a[index]) {
    					index++;
    					p2++;
    					has = true;
    				}
    				
    				if(!has) 
    					break;
    				
    			}
    			}
    			System.out.println(works ? "YES" : "NO");
    			
    		}
    	}
	
	
	
	
	public static void printIntArray(int [] a) {
		for(int i: a) System.out.print(i + " ");
		System.out.println();
	}
	
	public static void swapInt(int a, int b) {
		int temp = a;
		a = b;
		b = temp;
	}

	
	  public static void sort(int [] a) {
	    	ArrayList<Integer> b = new ArrayList<>();
	    	for(int i: a) b.add(i);
	    	Collections.sort(b);
	    	for(int i=0; i<a.length; i++) a[i]= b.get(i);
	    }
	  
	  public static void reverse(int [] a) {
	    	ArrayList<Integer> b = new ArrayList<>();
	    	for(int i: a) b.add(i);
	    	Collections.reverse(b);
	    	for(int i=0; i<a.length; i++) a[i]= b.get(i);
	    }


		
	
	
    static class FastScanner{
    	
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    	StringTokenizer st = new StringTokenizer("");
    	String next() {
    		while(!st.hasMoreTokens())
    			try {
    				st = new StringTokenizer(br.readLine());
    			} catch (IOException e){
    				e.printStackTrace();
    			}
    		return st.nextToken();
    	}
    	
    	int nextInt() {
    		return Integer.parseInt(next());
    	}
    	
    	int [] readArray(int n) {
    		int [] a = new int[n];
    		for(int i=0; i<n ; i++) a[i] = nextInt();
    		return a;
    	}
    	
    	long nextLong() {
    		return Long.parseLong(next());
    	}
    	
    	
    }
    
    
   
}


/*
 fun main(args: Array<String>) {
 	Main.main(args);
 }
 */

