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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class b729 {

	public static void main(String[] args) {
//System.out.println(1);
		FastReader sc = new FastReader();

//		System.out.println((int)'a');
		int t = sc.nextInt();
for(int o = 0 ; o<t;o++) {
	String s = sc.next();
//	int n = sc.nextInt();
	int n = s.length();
	int f = 0;
	int id = 0;
	int max = 0;
	boolean[]arr = new boolean[26];
	int k = 0;
	for(int i = 0 ; i<n;i++) {
		if(arr[(int)s.charAt(i)-97]) {
			k = 1;
			break;
		}else {
			arr[(int)s.charAt(i)-97] = true;
		}
	if((int)s.charAt(i)-96>max) {
		max = (int)s.charAt(i)-96;
	}
	}
	if(k==1) {
		System.out.println("No");
		continue;
	}
	if(max<n) {
		System.out.println("No");
		continue;
	}
	if(max>n) {
		System.out.println("No");
		continue;
	}
	for(int i = 0 ; i<n;i++) {
		
		if(s.charAt(i)=='a') {
			id = i;
			f = 1;
			break;
			
		}
	}
if(f==0) {
	System.out.println("No");
	continue;
}
int g = 0;
for(int i = id-1 ;i>=0;i--) {
	if((int)s.charAt(i)-96>n) {
		g =1 ;
		break;
	}
	if((int)s.charAt(i)<=(int)s.charAt(i+1)) {
		g =1 ; 
		break;
	}
}
if(g==1) {
	System.out.println("No");
	continue;
}
int h = 0;
for(int i = id+1 ;i<n;i++) {
	if((int)s.charAt(i)-96>n) {
		h =1 ;
		break;
	}
	if((int)s.charAt(i)<=(int)s.charAt(i-1)) {
		h =1 ; 
		break;
	}
}
if(h==1) {
	System.out.println("No");
	continue;
}
System.out.println("Yes");

}
		
		
	}

}
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;
    }
}
