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.
# python
import os;import re
import sys; import math
from io import BytesIO, IOBase

def main():
    l = "abcdefghijklmnopqrstuvwxyz"
    for _ in range(int(input())):
        s = input(); ans = ""; flag = 0; res = []
        if len(s) == 1 and s[0] == "a":
            ans = "YES"; flag = 1
        if "a" not in s:
            ans = "NO"; flag = 1
        else:
            f = s.index("a")
        for i in range(len(s)):
            if l[i] not in s:
                ans = "NO"; flag = 1
                break
        for i in range(len(s)):
            if s[i] not in res:
                res.append(s[i])
            else:
                ans = "NO"; flag = 1
                break
        if flag == 0:
            test = ['a']
            for i in range(1,len(s)):
                if s.index(l[i]) < s.index(l[i-1]):
                    test.insert(0,l[i])
                else:
                    test.append(l[i])
                
            temp = "".join(test)
            #print(temp)
            if temp == s:
                ans = "YES"
            else:
                ans = "NO"
            # for i in range(1,len(s)):
            #     if s.index(l[i]) > s.index(l[i-1]):
            #         if s.index(l[i]) == s.index(l[i-1])+1 or s.index(l[i]) == s.index(l[i-1])+i:
            #             pass
            #         else:
            #             ans = "NO"; break
            #     else:
            #         if s.index(l[i]) == s.index(l[i-1])-1 or s.index(l[i]) == s.index(l[i-1])-i:
            #             pass
            #         else:
            #             ans = "NO"; break
        if ans == "":
            print("YES")
        else:
            print(ans)

# region fastio 

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion
if(os.path.exists('input.txt')):
    sys.stdin = open("input.txt","r")
    sys.stdout = open("output.txt","w")
if __name__ == "__main__":
    main()