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 int long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define lb lower_bound
#define pq_max  priority_queue<int>
#define pq_min  priority_queue<int,vi,greater<int> >
#define trav(a,x) for (auto& a : x)
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rev(i,n,init) for(int i=n;i>=init;i--)
#define rep(i,j,n) for(int i=j; i<n; i++)
#define ump unordered_map
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef map<int,int> mpii;
const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;
template<typename T,typename T1>T amax(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T amin(T &a,T1 b){if(b<a)a=b;return a;}
const int N=10000;

void solve(int test_case) {
    string str;
    cin >> str;
    int n = str.length();
    set<int> s;
    for(auto ch: str) {
        if(s.count(ch - 'a' + 1) == 1) {
            cout << "NO\n";
            return;
        }
        s.insert(ch - 'a' + 1);
    }
    int i = 1;
    for(auto el: s) {
        if(el != i) {
            cout << "NO\n";
            return;
        }
        i++;
    }
    i = 0;
    while(str[i] != 'a') {
        i++;
    }
    int j = i-1;
    while(j >= 1) {
        if(str[j] > str[j-1]) {
            cout << "NO\n";
            return;
        }
        j--;
    }
    while(i < n-1) {
        if(str[i] > str[i+1]) {
            cout << "NO\n";
            return;
        }
        i++;
    }
    cout << "YES\n";

}
int32_t main(){
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int t =1 ;
cin>>t;
rep(i,1,t+1){
    solve(i);
}
return 0;
}
