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 loop(i,a,n) for(ll i=a;i<n;++i)
#define revloop(i,a,b) for(ll i=a;i>=b;--i)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define INF 9999999999999999
#define MOD 1000000007

ll power(ll a,ll b,ll mod)
{
    ll ans=1;
    while(b>0)
    {
        if (b%2==1)
            ans=((ans%mod)*(a%mod))%mod;;
        a=((a%mod)*(a%mod))%mod;
        b=b/2;
    }
    return ans;
}
 
void func()
{
    string s;
    cin>>s;
    ll n=s.length();
    ll index = -1;
    loop(i,0,n){
        if(s[i]=='a') {
            index=i;
            break;
        }
    }
    bool flag=true;
    for (int i = index+1; i < n; ++i)
    {
        if(s[i]<s[i-1]){
            flag=false;
            break;
        }
    }
    for (int i = index-1; i >= 0; --i)
    {
        if(s[i]<s[i+1]){
            flag=false;
            break;
        }
    }
    sort(s.begin(), s.end());
    string test="";
    char start='a';
    loop(i,0,n){
        test+=start;
        start++;
    }
    if(test!=s){
        flag=false;
    }
    if (flag)
    {
        cout<<"YES"<<"\n";
    }
    else{
        cout<<"NO"<<"\n";
    }
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
 
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r" , stdin);
    freopen("output.txt", "w" , stdout);
    #endif
 
    ll t=1;
    cin>>t;
    //solve();
    while(t--)
    {
        func();
    }
 
}