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.HashSet;
import java.util.StringTokenizer;

public class B {

    public static void main(String[] args) throws IOException {
        int t = sc.nextInt();

        for (int i = 0; i < t; i++) {
            String s = sc.next();
            int l = s.length();
            int j = 0;
            int k = l - 1;
            boolean check1 = true,check2 = true;
            HashSet<Character> h = new HashSet<>();
            boolean check3 = false;

            for (int jj = 0; jj < l; jj++) {
                if(h.contains(s.charAt(jj))){
                    check3 = true;
                    break;
                }
                else{
                    h.add(s.charAt(jj));
                }
            }
            if(check3){
                System.out.println("NO");
                continue;
            }

            while(check1 && check2){
                if(j == k){
                    check2=false;
                }
                if(s.charAt(j) == l+97-1){
                    j++;
                    l--;
                }
                else{
                    if(s.charAt(k) == l+97-1){
                        k--;
                        l--;
                    }
                    else{
                        check1 = false;
                    }
                }
            }
            if(!check1){
                System.out.println("NO");
                continue;
            }
            if(!check2){
                System.out.println("YES");
                continue;
            }


//            boolean check = false;
//            boolean check1 = false;
//            if(h.size()<l){
//                System.out.println("NO");
//                continue;
//            }
//            for (int j = 0; j < l; j++) {
//                if(s.charAt(j) == 'a'){
//                    a = j;
//                }
//            }
//            for (int j = a+1; j < l; j++) {
//                arr[s.charAt(j)-97] = j-a;
//            }
//            for (int j = a-1; j>=0; j--) {
//                arr[s.charAt(j)-97] = a-j;
//            }
//
//            for (int j = 0; j < 26; j++) {
//                if(arr[j] > j){
//                    check = true;
//                    System.out.println("NO");
//                    break;
//                }
//            }
//            if(!check){
//                System.out.println("YES");
//            }
        }
    }
    private static class sc{
        static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        static StringTokenizer tokenizer = new StringTokenizer("");
        static String next() throws IOException {
            while (!tokenizer.hasMoreTokens())
                tokenizer = new StringTokenizer(reader.readLine());
            return tokenizer.nextToken();
        }
        static int nextInt() throws IOException{
            return Integer.parseInt(next());
        }
        static double nextDouble() throws IOException{
            return Double.parseDouble(next());
        }
        static long nextLong() throws IOException{
            return Long.parseLong(next());
        }
    }
}
