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<iostream>
#include<vector>
#include<deque>
#include<algorithm>
#include<map>
#include<array>
#include<utility>
#include<cmath>
#include<queue>
#include<string>
#include<assert.h>

#define MAX64 0x7fffffffffffffff
#define MAX32 0x7fffffff

typedef int_fast64_t ll;
typedef int_fast64_t i64;
typedef int_fast32_t i32;

int main (){
    std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr);
    
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    i32 test_cases;
    std::cin>> test_cases;
    while(test_cases--){
        std::string s;
        std::cin >> s;

        i32 loc_of_a = 0;
        for(i32 i = 0; i < s.size(); i++){
            if(s[i] == 'a') loc_of_a = i;
        }

        char current = 'a'; i32 l = loc_of_a, r = loc_of_a + 1; bool suffice = true;
        while(current <= 'a' + s.size() - 1){
            if(l >= 0 && s[l] == current){
                l -= 1;
                current += 1;
                continue;
            }

            if(r < s.size() && s[r] == current){
                r += 1;
                current += 1;
                continue;
            }

            suffice = false;
            break;
        } 

        if(suffice) std::cout <<"YES\n";
        else std::cout << "NO\n";
    }
}