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.
/*
    author: plenka
*/

#include <bits/stdc++.h>

#define int long long
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define FOR(i, x, n) for (long long i = x; i < n; ++i)
#define ROF(i, x, n) for (long long i = x; i > n; --i)
#define ff first
#define ss second

using namespace std;

typedef long double ld;
typedef unsigned long long ull;

const int INF = 1e18 + 7;
const ld EPS = 1e-12;
const double PI = 3.1415;

void solve() {
    int n;
    string s;
    cin >> s;
    n = sz(s);
    int a = -1;
    FOR(i, 0, n)
        if (s[i] == 'a') {
            a = i;
            break;
        }
    if (a == -1) {
        cout << "NO\n";
        return;
    }
    int l = a - 1, r = a + 1;
    char x = 'b';
    while (1) {
        if (l > -1 && s[l] == x) {
            x++;
            l--;
        } else if (r < n && s[r] == x) {
            x++;
            r++;
        } else
            break;
    }
    if (l > -1 || r < n)
        cout << "NO\n";
    else
        cout << "YES\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}
