#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define nl "\n"
#define NL "\n"
#define Nl "\n"
#define lp(i,n) for(int i=0;i<n;i++)
#define rlp(n,j) for(int i=n-1;i>=0;i--)
#define F first
#define S second
#define GCD __gcd
#define all(a) a.begin(), a.end()
#define TESTS int T;cin>>T;while(T--)
int dx[] = { 1,0,0,-1 };
int dy[] = { 0,1,-1,0 };
const double pi = acos(-1.);
const double eps = 1e-15;
const int MOD = 1e9 + 7;
ll power(ll x, ll y)
{
	if (y == 0)
		return 1;
	ll s = power(x, y / 2);
	s *= s;
	//s %= MOD;
	if (y & 1)
		s *= x;
	//s %= MOD;
	return s;
}
ll Ceil(ll x, ll y)
{
	return (x + y - 1) / y;
}
ll gcd(ll a, ll b)
{
	if (b == 0)
		return a;
	if (a == 0)
		return b;
	return gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
	return a * b / gcd(a, b);
}
string s;
int n;
bool can(int l, int r)
{
	char nxt = 'b';
	while (1)
	{
		if (l < 0 and r >= n)
			break;
		bool x1 = 1, x2 = 1;
		if (l >= 0 and s[l] == nxt)
			l--;
		else if (r < n and s[r] == nxt)
			r++;
		else
			return 0;
		nxt++;
	}
	return 1;
}
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	TESTS
	{
		cin >> s;
		n = s.size();
		int start = -1;
		lp(i, n)
			if (s[i] == 'a')
				start = i;
		if (start == -1)
			cout << "No\n";
		else
			cout << (can(start - 1, start + 1) ? "YES\n" : " NO\n");
	}
}