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.math.BigInteger;

import java.io.*;

public class Main implements Runnable {

    public static void main(String[] args) {
        new Thread(null, new Main(), "whatever", 1 << 26).start();
    }


    private FastScanner sc;
    private PrintWriter pw;

    public void run() {
        try {
            // pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
            // sc = new FastScanner(new BufferedReader(new FileReader("input.txt")));
            pw = new PrintWriter(System.out);
            sc = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));
        } catch (Exception e) {
            throw new RuntimeException();
        }
        int t = sc.nextInt();
        // int t = 1;
        while (t-- > 0) {
            solve();
        }
        pw.close();
    }

    public long mod = 1_000_000_007;


    public void solve() {
        char[] s = sc.next().toCharArray();
        boolean found = false;

        int[] arr = new int[26];
        int[] pos = new int[26];
        int temp, posa = -1;
        for (int i = 0; i < s.length; i++) {
            temp = ((int)s[i]) - 97;
            pos[temp] = i;
            if (temp >= s.length) {
                pw.println("NO");
                return;
            }
            if (temp == 0) posa = i;
            arr[temp]++;
            if (arr[temp] != 1) {
                pw.println("NO");
                return;
            }
        }

        if (posa == -1) {
            pw.println("NO");
            return;
        }

        int[] count = new int[26];

        for (int i = 0; i < posa - 1; i++) {
            for (int j = i + 1; j < posa; j++) {
                if (s[i] - s[j] < 0) {
                    pw.println("NO");
                    return;
                } else {
                    count[s[i] - 'a']++;
                }
            }
            int fix = s[i] - 'a' - 1 - count[s[i] - 'a'];
            for (int j = posa + 1; j <= posa + fix; j++) {
                if (s[i] - s[j] < 0) {
                    pw.println("NO");
                    return;
                }
            }
        }
        // pw.println("Fine till now");

        char[] ss = new char[s.length];

        for (int i = s.length - 1, j = 0; i >= 0; i--) {
            ss[i] = s[j++];
        }
        posa = s.length - posa;

        for (int i = 0; i < posa - 1; i++) {
            for (int j = i + 1; j < posa; j++) {
                if (ss[i] - ss[j] < 0) {
                    pw.println("NO");
                    return;
                } else {
                    count[ss[i] - 'a']++;
                }
            }
            int fix = ss[i] - 'a' - 1 - count[ss[i] - 'a'];
            for (int j = posa + 1; j <= posa + fix; j++) {
                if (ss[i] - ss[j] < 0) {
                    pw.println("NO");
                    return;
                }
            }
        }

        pw.println("YES");
    }







    class FastScanner {
        private BufferedReader reader = null;
        private StringTokenizer tokenizer = null;

        public FastScanner(BufferedReader bf) {
            reader = bf;
            tokenizer = null;
        }

        public String next() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken("\n");
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public float nextFloat() {
            return Float.parseFloat(next());
        }

        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = nextInt();
            }
            return a;
        }

        public String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) {
                a[i] = next();
            }
            return a;
        }

        public long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                a[i] = nextLong();
            }
            return a;
        }

    }
}
