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.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lli long long int
#define ull unsigned long long
#define pb push_back
#define ff first
#define ss second
#define mod 1000000007
//Manish Rai 
void fast()
{
  ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}
// ll power(ll base,ll n)  //Binary Exponential
// {
//   ll ans=1;
//   while(n>0)
//   {
//     if(n%2)
//     {
//       ans=(ans*base);

//     }
//     base=(base*base);
//     n>>=1;
//   }
//   return ans;
// }
// bool prime[11000];
// void sieve()
// {
//   memset(prime, true, sizeof(prime));
//   for (int p = 2; p * p <= 11000; p++)
//     {
        
//         if (prime[p] == true)
//         {
//             for (int i = p * p; i <= 11000; i += p)
//                 prime[i] = false;
//         }
//     }
// }
    
// bool palindrome(string str)  // if palindrome it will return true
// {
//     for (int i = 0, j = str.length() - 1;i < j; i++, j--) {

//         if (str[i] != str[j])
//             return false;
//     }
 
//     return true;
// }
// bool isPowerOfTwo(ll n)
// {
//    if(n==0)
//    return false;
 
//    return (ceil(log2(n)) == floor(log2(n)));
// }

// int check(string s)
// {
//   int index=-1;
//   int hash[26]={0};
//   for(int i=0;i<s.length();i++)
//   {
//     hash[s[i]-'a']++;
//   }
//   int temp=-1;
//   for(int i=0;i<s.length();i++)
//   {
//     if(hash[i]>1 || hash[i]==0)
//     {
//       return 0;
//     }
//   }
//   for(int i=0;i<s.length();i++)
//   {
//     if(s[i]=='a')
//     {
//       temp=i;
//       break;
//     }
//   }
//   if(s[temp]=='a')
//   {
//         for(int i=temp;i<s.length()-1;i++)
//       {
//          if(s[i]>s[i+1])
//          {
//           return 0;
//          }
//       }
//       for(int i=temp;i>=1;i--)
//       {
//          if(s[i]>s[i-1])
//          {
//           return 0;
//          }
//       }
//       return 1;

//       }
//       else
//       {
//         return 0;
//       }
// }
int main()
{
  fast();
  int tc;
  cin>>tc;
  while(tc--)
  {
    string s;
         cin>>s;
         int flag=1;
         vector<int>v(26,0);
         for(int i=0; i<s.size(); i++)
          v[s[i]-'a']++;
         int sum=0;
         for(int i=0; i<s.size(); i++){
          sum+=v[i];
          if(v[i]>1)
           flag=0;
         }
         if(sum!=s.size())
           cout<<"NO\n";
          
        else
        {
          int ind=0;
           for(int i=0; i<s.size(); i++)
            {
              if(s[i]=='a')
              {
                ind=i;
                break;
              }
            }
           for(int i=0; i<ind-1; i++)
           {
            if(s[i]<s[i+1])
            {
              flag=0;
              break;
            }
           }
          for(int i=ind+1; i<s.size()-1; i++)
          {
            if(s[i]>s[i+1])
            {
              flag=0;
              break;
            }
          }
          if(flag)
           cout<<"YES\n";
          else
          cout<<"NO\n";
        }
     
  }
}