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 alphabeticalStrings {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(
                new InputStreamReader(System.in));
        }
        public FastReader(String file_name)throws IOException
        {
            br = new BufferedReader(
                new FileReader(file_name));
        }

        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 int[] nextArray(int n){
            int ar[] = new int[n];
            for(int i=0;i<n;i++)
                ar[i] = this.nextInt();
            return (ar);
        }
    }

   static class OutputWriter{
        BufferedWriter writer;

         public OutputWriter(OutputStream stream){
           writer = new BufferedWriter(new OutputStreamWriter(stream));
         }

         public OutputWriter(String file_name) throws IOException{
           writer = new BufferedWriter(new FileWriter("output.txt"));
         }
       
         public void print(int i) throws IOException {
           writer.write(i);
         }

         public void print(String s) throws IOException {
            writer.write(s);
          }

         public void print(char []c) throws IOException {
            writer.write(c);
         }

         public void println(int i) throws IOException {
           writer.write(i+"\n");
         }

         public void println(long i) throws IOException {
           writer.write(i+"\n");
         }

         public void println(String s) throws IOException {
            writer.write(s+"\n");
          }

         public void println(char []c) throws IOException {
            writer.write(c+"\n");
         }

         public  void close() throws IOException {
            writer.close();
         }

    }
    public static long gcd(long a,long b){
        return(a==0?b:gcd(b%a,a));
    }
    public static long lcm(long a,long b){
        //return (a*b)/gcd(a,b);
        //this is modified to avoid integer overflow by multiplying a*b
        return((a/gcd(a,b))*b);
    }
    public static void initialize_io_redirection()throws IOException{
        try{
            boolean MP = System.getProperty("MY_PC")!=null;
            if(MP){
                fs = new FastReader("input.txt");
                op = new OutputWriter("output.txt");
                System.setOut(new PrintStream(new File("output.txt")));
            }
            else{
                fs = new FastReader();
                op = new OutputWriter(System.out);
            }
       }
       catch(Exception e){
            fs = new FastReader();
            op = new OutputWriter(System.out);
       }
    }
   static FastReader fs;
   static OutputWriter op;
    public static void main(String[] args)throws IOException{
        initialize_io_redirection();
        int t = fs.nextInt();
        while(t-- > 0)
            solve();
        op.close();
    }

    public static void solve()throws IOException{
        String s=fs.nextLine();
        StringBuilder st=new StringBuilder(s);
        int l=st.length();
        char lc=(char)(96+l);
        boolean done=true;
        while(st.length()>0){
        	char chl=st.charAt(0),chr=st.charAt(l-1);
        	if(lc==chl){
        		st.deleteCharAt(0);
        	}
        	else{
        		if(lc==chr){
        			st.deleteCharAt(l-1);
        		}
        		else{
        			done=false;
        			break;
        		}
        	}
        	l--;
        	lc--;
        }
        System.out.println(done?"YES":"NO");
    }
}

