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 javax.swing.text.DefaultStyledDocument.ElementSpec;

import java.io.*;

public class Codeforces {
    final static long mod = 1000000007;

    public static void main(String[] args) throws Exception {
        FastReader sc = new FastReader();
        int t = sc.nextInt();
        outer: while (t-- > 0) {
            char[] c = sc.next().toCharArray();

            int[] ind = new int[27];
            int[] map = new int[27];
            int n = c.length;
            for (int i = 0; i < n; i++) {
                int x = c[i] - 96;
                if (map[x] == 0 && x <= n) {
                    map[x]++;
                    ind[x] = i;
                } else {
                    System.out.println("NO");
                    continue outer;
                }
            }

            int left = ind[1] - 1;
            int right = ind[1] + 1;
            for (int i = 2; i <= n; i++) {
                if (ind[i] == left) {
                    left--;
                } else if (ind[i] == right) {
                    right++;
                } else {
                    System.out.println("NO");
                    continue outer;
                }
            }

            System.out.println("YES");

        }
    }

    public static String get(String s, int k) {
        int n = s.length();
        int rep = k % n == 0 ? k / n : k / n + 1;
        s = s.repeat(rep);

        return s.substring(0, k);

    }

    public static int diglen(Long y) {
        int a = 0;
        while (y != 0L) {
            y /= 10;
            a++;

        }
        return a;
    }

    static class FastReader {

        BufferedReader br;
        StringTokenizer st; // StringTokenizer() is used to read long strings

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

    public class Pair implements Comparable<Pair> {
        public final int index;
        public final int value;

        public Pair(int index, int value) {
            this.index = index;
            this.value = value;
        }

        @Override
        public int compareTo(Pair other) {
            // multiplied to -1 as the author need descending sort order
            return -1 * Integer.valueOf(this.value).compareTo(other.value);
        }
    }

    static String reverseString(String str) {
        StringBuilder input = new StringBuilder();
        return input.append(str).reverse().toString();
    }

    static long factorial(int n, int b) {
        if (n == b)
            return 1;

        return n * factorial(n - 1, b);
    }

    static int lcm(int ch, int b) {
        return ch * b / gcd(ch, b);
    }

    static int gcd(int ch, int b) {
        return b == 0 ? ch : gcd(b, ch % b);
    }

    static double ceil(double n, double k) {
        return Math.ceil(n / k);
    }

    static int sqrt(double n) {
        return (int) Math.sqrt(n);
    }

}
