/*
    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;
}
