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.
//MS0089 PVT LTD..........
//All rights reserved.....
#include<bits/stdc++.h>
using namespace std;
#define mcout(a) for(auto i=a.begin();i!=a.end();i++)cout<<*i<<" ";
#define mcin(a,n) for(int i=0;i<n;i++)cin>>a[i];
#define mnl cout<<endl;
#define ll long long
int main()
{
   int t;
   cin>>t;
  // t=1;
   while(t--)
   { 
         string s;
         cin>>s;
         int n=s.length();
         //bool ok=false;
         int in=0;
         int arr[26]={0};
         int p=0,q=0;
         bool ok=true;
         if(n==1 && s[0]!='a')
         {
             in=1;
         }
         for(int i=0;i<n;i++)
         {
             arr[s[i]-'a']++;
             if(s[i]=='a')
             {
                 p=i;
                 
             }
             
         }
         for(int i=0;i<n;i++)
         {
             if(arr[i]>1 || arr[i]==0)
             {
                 in=1;
             }
         }
         q=p+1;
         p--;
         int k=1;
         while(p>=0 && q<n)
         {
             if(s[q]==k+'a')
             {
                 q++;
             }
             else if(s[p]==k+'a')
             {
                 p--;
             }
             else
             {
                 ok=false;
                 break;
             }
             k++;
         }
         while(p>=0)
         {
             if(s[p]==k+'a')
             {
                 p--;
             }
             else
             {
                 ok=false;
                 break;
             }
             k++;
         }
         while(q<n)
         {
             if(s[q]==k+'a')
             {
                 q++;
             }
             else
             {
                 ok=false;
                 break;
             }
             k++;
         }
         
         if(ok && in==0)
         {
             cout<<"YES"<<endl;
         }
         else
         {
             cout<<"NO"<<endl;
         }
         
       
   }
   return 0;
}