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.
import java.util.*;
import java.io.*;

public class B_Alphabetical_Strings{
    public static void main(String[] args) {
        FastScanner s= new FastScanner();
        StringBuilder res = new StringBuilder();
        int t=s.nextInt();
        int p=0;
        while(p<t){
        String str=s.nextToken();
        HashMap<Character,Integer> pos = new HashMap<Character,Integer>();
        int n=str.length();
        int flag=0;
        for(int i=0;i<n;i++){
            char ch=str.charAt(i);
            if(pos.containsKey(ch)){
                 flag=1;
                 break;
            }
            else{
                pos.put(ch,i);
            }
        }
        if(flag==1){
            res.append("NO\n");
            p++;
            continue;
        }
        int check=0;
        HashMap<Character,Integer> delta = new HashMap<Character,Integer>();
        for(int i=0;i<n;i++){
            char ch=(char)(i+97);
            if(pos.containsKey(ch)){
                if(ch=='a'){
                    delta.put('a',0);
                    continue;
                }
                int num=ch;
                num--;
                char ch2=(char)num;
                int num3=pos.get(ch)-pos.get(ch2);
                delta.put(ch,num3);
            }
            else{
                check=1;
                break;
            }
        }
        if(check==1){
            res.append("NO\n");
            p++;
            continue;
        }
        String str2="";
        int check2=0;
        for(int i=0;i<n;i++){
            if(i==0){
                str2=str2+'a';
                continue;
            }
            char ch=(char)(i+97);
            char ch2=(char)(i+97-1);
            int del=delta.get(ch);
            int size=str2.length();
            int sizep=size;
            int sizen=(size)-(2*size);
            if(del==1){
                if(str2.charAt(size-1)==ch2){
                    str2=str2+ch;
                }
                else{
                    check2=1;
                    break;
                }
            }
            else if(del==-1){
                 if(str2.charAt(0)==ch2){
                    str2=ch+str2;
                }
                else{
                    check2=1;
                    break;
                }
            }
            else if(del==sizep){
                if(str2.charAt(0)==ch2){
                    str2=str2+ch;
                }
                else{
                    check2=1;
                    break;
                }
            }
            else if(del ==sizen){
                if(str2.charAt(size-1)==ch2){
                    str2=ch+str2;
                }
                else{
                    check2=1;
                    break;
                }
            }
            else{
                check2=1;
                break;
            }
            

        }
        if(check2==1){
            res.append("NO\n");
        }
        else{
            res.append("YES\n");
        }
        p++;
    }
    System.out.println(res);
    }
    static class FastScanner {
		BufferedReader br;
		StringTokenizer st;
 
		public FastScanner(String s) {
			try {
				br = new BufferedReader(new FileReader(s));
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
 
		public FastScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String nextToken() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(nextToken());
		}
 
		long nextLong() {
			return Long.parseLong(nextToken());
		}
 
		double nextDouble() {
			return Double.parseDouble(nextToken());
		}
	}




}