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

public class Main {
    private static final fast sc = new fast();
    private static final BufferedWriter sout = new BufferedWriter(new OutputStreamWriter(System.out));
    private static final int OO = (int) 998244353;
    private static final double PI = Math.acos(-1);
    //right,down,left,up
    private static final int[] dx4 = {0, 1, 0, -1}, dx = {0, 0, 1, -1, 1, -1, 1, -1};
    private static final int[] dy4 = {1, 0, -1, 0}, dy = {1, -1, 0, 0, 1, -1, -1, 1};
    //static void print6P{ System.out.printf("%8.6f\n"); }
    static boolean vis[] = new boolean[(int) (1e5 + 9)];
    static int res = 0;
    static HashSet<String> set = new HashSet<>();

    public static void main(String[] args) throws IOException {
        //Start from here.
        int t = sc.nextInt();
        while (t-- > 0) {
            String s = sc.nextLine();
            int n = s.length();
            Map<Character, Integer> map = new HashMap<>();
            boolean b = false;
            for (int i = 0; i < n; i++) {
                map.put(s.charAt(i), map.getOrDefault(s.charAt(i), 0) + 1);
                if (map.get(s.charAt(i)) > 1) {
                    b = true;
                    break;
                }
            }
            if (b || !map.containsKey('a') || map.get('a') > 1) {
                sout.write("NO" + "");
            } else {
                String tem = "a";
                for (int i = 1; i < n; i++) {
                    char curC = (char) ('a' + i);
                    if (isSub(s, tem + "" + curC)) {
                        tem = tem + "" + curC;
                    } else if (isSub(s, curC + "" + tem)) {
                        tem = curC + "" + tem;
                    } else {
                        b = true;
                        break;
                    }
                }
                sout.write((b ? "NO" : "YES") + "");
            }
            sout.write("\n");
        }

        //end here
        sout.close();
    }

    static boolean isSub(String s, String ss) {
        int j = 0;
        for (int i = 0; i < s.length(); i++) {
            if (j != ss.length() && s.charAt(i) == ss.charAt(j)) {
                j += 1;
            }
        }
        return j == ss.length();
    }

    static class fast {
        BufferedReader br;
        StringTokenizer st;

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

        boolean hasNext() {
            if (st != null && st.hasMoreTokens()) {
                return true;
            }
            String tmp;
            try {
                br.mark(1000);
                tmp = br.readLine();
                if (tmp == null) {
                    return false;
                }
                br.reset();
            } catch (IOException e) {
                return false;
            }
            return true;
        }

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

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

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

        double nextFloat() {
            return Float.parseFloat(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    static class Pair implements Comparable<Pair> {
        Integer first;
        Integer second;

        Pair(Integer first, Integer second) {
            this.first = first;
            this.second = second;
        }

        @Override
        public int compareTo(Pair o) {
            if (o.first.equals(first)) {
                return Double.compare(first, o.first);
            }
            return Double.compare(o.first, first);
        }

        @Override
        public boolean equals(Object o) {
            if (o instanceof Pair) {
                Pair p = (Pair) o;
                return p.first.equals(first) && p.second.equals(second);
            }
            return false;
        }

        @Override
        public int hashCode() {
            return first.hashCode() * 31 + second.hashCode();
        }
    }

    static class Triple implements Comparable<Triple> {
        Integer f;
        Integer s;
        Integer t;


        Triple(Integer first, Integer second, Integer third) {
            this.f = first;
            this.s = second;
            this.t = third;
        }

        @Override
        public int compareTo(Triple o) {
            return Long.compare(o.f, f);
        }
    }

}