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

public class cf2 {

    public static void main(String[] args) {

        FastScanner scn = new FastScanner();
        int testCase = scn.nextInt();
        for (int z = 0; z < testCase; z++) {
            String s = scn.next();
            int start = Integer.MAX_VALUE;
            int end = Integer.MAX_VALUE;
            int bb = 0;
            for (int i = 0; i < s.length(); i++)
                if (s.charAt(i) == 'a'){
                    start = i;
                    break;
                }
            end = start;
            if(start==Integer.MAX_VALUE)
            bb=1;
            if(bb==1){
                System.out.println("no");
                continue;
            }

            for (int i = 1; i < s.length(); i++) {
                if (start == 0  ) {
                    if((s.charAt(end + 1) == (char) (i + 97)))
                        end++;
                    else{
                    bb=1;
                    break;}
                    continue;

                } else if ((end == s.length() - 1) ) {
                if( (s.charAt(start - 1) == (char) (i + 97)))
                        start--;
                        else{
                        bb=1;
                        break;}
                    continue;

                } else if (s.charAt(start - 1) == (char) (i + 97) || s.charAt(end + 1) == (char) (i + 97)) {

                    if (s.charAt(start - 1) == (char) (i + 97))
                        start--;
                    else
                        end++;
                    continue;
                }
                else{
                    bb=1;
                    break;
                }

            }
            if(bb==1)
            System.out.println("no");
            else
            System.out.println("yes");

        }

    }

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

}