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.
#pragma GCC optimize("Ofast")  
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
   
#define ff               first
#define ss               second
#define int              long long
#define pb               push_back
#define mp               make_pair
#define pii              pair<int,int>
#define vi               vector<int>
#define mii              map<int,int>
#define pqb              priority_queue<int>
#define pqs              priority_queue< int,vi,greater<int> >
#define setbits(fans)       __builtin_popcountint(fans)
#define zrobits(fans)       __builtin_ctzint(fans)
#define mod              1000000007
#define inf              1e10
#define ps(fans,temp1)          fixed<<setprecision(temp1)<<fans
#define mk(A,n,type)   type *A=new type[n];
#define w(fans)             int fans; cin>>fans; while(fans--)
#define me(i,start,end)  for(int i=start;i<end;i++)
#define she(i,end,start) for(int i=end-1;i>=start;i--)
#define poora(v)         v.begin(),v.end()
 
double pi = 3.141592653589793238; 
   
void fast_io()
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  #endif
}
 
int binpow(int A, int b, int m) {
    A %= m;
    int Result = 1;
    while (b > 0) {
        if (b & 1)
            Result = Result * A % m;
        A = A * A % m;
        b >>= 1;
    }
    return Result;
}
 
int gcd(int A, int b)
{
    if (b == 0)
        return A;
    return gcd(b, A % b);
     
}   



int32_t main()
{
    fast_io();
    
    w(t)
    {
        string s;
        cin>>s;

        int n=s.size();

        char final = 'a'+n-1;

        int start=-1;
        int end=-1;

        string temp = s;
        sort(temp.begin(),temp.end());

        int flag=0;

        for(int i=0;i<n;i++)
        {
            if(temp[i]!='a'+i)
            {
                flag=1;
                break;
            }
        }

        for(int i=0;i<n;i++)
        {
            if(s[i]=='a')
            {
                start=i;
                end=i;
                break;
            }
        }

        if(start==-1 || flag ==1)
            cout<<"NO"<<endl;
        else{

            char curr = 'b';

            while(true)
            {
                if(curr>final)
                {
                    cout<<"YES\n";
                    break;
                }

                if(((start-1)>=0 && s[start-1]==curr))
                {
                    curr++;
                    start--;
                }
                else if(((end+1)<n && s[end+1]==curr))
                {
                    curr++;
                    end++;
                }
                else {
                    cout<<"NO\n";
                    break;
                }
            }
        }
    }

    return 0;

}
 
