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 pb push_back
#define ff first
#define ss second
#define lli long long int
#define ll long long
#define st string
#define vi vector<int>
#define vll vector<long long>
#define tll tuple<ll,ll,ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpii vector<pii>
#define vpll vector<pll>
#define take(n) ll n;cin>>n;
#define takeinp(arr,n) for(long long int i=0;i<n;i++) cin>>arr[i];
#define gcd(a,b) __gcd(a,b)
#define mii map<int,int>
#define mll map<ll,ll>
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define mllitr mll::iterator itr;
#define repm(itr,mp) for(itr=mp.begin();itr!=mp.end();itr++)
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repo(i,a,b) for(ll i=a;i>b;i--)

            //GL HF//

void solve(){
    string s;cin>>s;
    ll n=s.length()-1;
    // cout<<char('a'+n)<<"\n";
    if(n==0){
        if(s[0]!='a') {cout<<"NO\n";return;}
    }
    while(n>=0){
        char tmp = 'a'+n;
        if(s[0]==tmp){
            s.erase(s.begin()+0);
        }else if(s[n]==tmp){
            s.erase(s.begin()+n);
        }else{
            cout<<"NO\n";
            return;
        }
        n--;
    }
    cout<<"YES\n";
    // cout<<'a'+0<<'\n';
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    ll t=1;
    cin>>t;
    while(t--){
        solve();
    }
}
