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 <cmath>
#include <cstring>
#include <algorithm>
#include <map>
#include <list>
#include <queue>
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <deque>
using namespace std;
typedef long long ll;
#define _for(i,a,b) for(int i=(a) ;i<=(b) ;i++)
#define _rep(i,a,b) for(int i=(a) ;i>=(b) ;i--)
#define scd(v) scanf("%d",&v)
#define scdd(a,b) scanf("%d %d",&a,&b)
#define endl "\n"
#define IOS ios::sync_with_stdio(false)
#define pb push_back
#define all(v) v.begin(),v.end()
#define int long long
#define mst(v,a) memset(v,a,sizeof(v))
const int N = 2e4+10;
char s[50];
signed main()
{
    //!!
//    freopen("data.txt","r",stdin);
    //!!
    IOS;
    int T;cin>>T;
    while(T--)
    {
        cin>>(s+1);
        int len = strlen(s+1);
        int st=-1;
        _for(i,1,len)
        {
            if( s[i] == 'a') st = i;
        }
        int l=st,r=st;
        int cnt=1;
        int flag=0;
                if( st==-1 ) flag=1;

        while( cnt<len )
        {
            if( l-1 >= 1 && s[l-1] == (char)cnt+'a' ) l--,cnt++;
            else if( r+1<=len && s[r+1] == (char) cnt+'a' ) r++,cnt++;
            else
            {
//                cout<<" !! "<<cnt<<endl;
                flag=1;break;
            }
        }
//        cout<<" l r "<<l<<" "<<r<<endl;
//        cout<<st<<" "<<cnt<<endl;
        if( flag ) cout<<"NO"<<endl;
        else cout<<"YES"<<endl;
    }
}
