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.
/* بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ */
#define INPUT FASTIO;
//#define INPUT freopen("test.txt", "r", stdin);
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define FASTIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define mp make_pair
#define pb push_back
#define sz(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define parseArray(A, n) for ( ll K = 0; K < n; K++) { cin >> A[K]; }
#define debug(c) for (auto e: c) cerr << e << " "; cerr << endl;
ll modInverse(ll a, ll b){ return 1<a ? b - modInverse(b%a, a)*b/a : 1; }
ll gcd(ll a, ll b){ return b?gcd(b, a % b):a; }
ll lcm(ll a, ll b){ return (a*b)/gcd(a, b); }
#define PI 3.14159265358979323846
#define uniq(v) v.resize(distance(v.begin(), unique(all(v))))
#define low_b(v, x) lower_bound(all(v), x) - v.begin()

int main(){ 
  INPUT
  ll t; cin >> t;
  while (t--) {
    string s; cin >> s;
    int left = -10, right = -10;
    for ( int k = 0; k < (int)s.length(); k++ ){
      if (s[k] == 'a') {
        left = right = k;
        break;
      }
    }
    string ans = "YES";
    int n = (int)s.length();
    char c = 'a';
    while (left - 1 >= 0 || right + 1 < n) {
      if (left - 1 >= 0 && s[left - 1] == c + 1) {
        left--;
        c++;
      } else if (right + 1 < n && s[right + 1] == c + 1) {
        right++;
        c++;
      } else {
        ans = "NO";
        break;
      }
    }
    cout << ans << "\n";
  }
  return 0;
}
