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.
    /*
     * To change this license header, choose License Headers in Project Properties.
     * To change this template file, choose Tools | Templates
     * and open the template in the editor.
     */
    import java.util.*;
    import java.util.Arrays;


    /**
     *
     * @author DELL
     */
      public class solution{

               static long power(long n,long ans){
                   if(n==0)return ans;
                   return ans=power(n-1,ans)*2;
               }
               static boolean prime(int n){
                   for(int i=2;i*i<=n;i++){
                       if(n%i==0)return false;
                   }
                   return true;
               }
               static long power(long x, int y, int p)
                {
                  long res = 1; // Initialize result

                  x = x % p; // Update x if it is more than or
                  // equal to p

                  if (x == 0)
                    return 0; // In case x is divisible by p;

                  while (y > 0)
                  {

                    // If y is odd, multiply x with result
                    if ((y & 1) != 0)
                      res = (res * x) % p;

                    // y must be even now
                    y = y >> 1; // y = y/2
                    x = (x * x) % p;
                  }
                  return res;
                }
               static int gcd(int a,int b)
                {
                    if(b%a==0)
                    return a;
                    return gcd(b%a,a);
                }

        public static void main(String[] args) {
             Scanner sc=new Scanner(System.in);
             StringBuilder sb=new StringBuilder();
             int t=sc.nextInt();
             while(t-->0){
                 String s=sc.next();
                 int r=0,l=s.length()-1;
                 char temp=(char)Math.max(s.charAt(r), s.charAt(l));
                 ArrayList<Character> arr=new ArrayList();
                 boolean b=false;
                 for(int i=0;i<s.length();i++)arr.add(s.charAt(i));
                 while(arr.size()!=0){
                     if(arr.get(arr.size()-1)==temp){
                         if(temp=='a'){
                             arr.remove(arr.size()-1);b=true;
                             break;
                         }
                         arr.remove(arr.size()-1);
                         temp=(char)(temp-1);
                     }
                     else if(arr.get(0)==temp){
                         if(temp=='a'){
                             arr.remove(0);b=true;
                             break;
                         }
                         arr.remove(0);
                         temp=(char)(temp-1);
                     }
                     else {
                         break;
                     }
                 }
                 
                 if(arr.size()==0 && temp=='a' && b)System.out.println("YES");
                 else System.out.println("NO");
             }
        }

    }
