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.
// 10-Jul-2021
import java.util.*;
import java.io.*;

public class B {
	static class FastReader {

		BufferedReader br;
		StringTokenizer st;

		private FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		int[] nextIntArrayOne(int n) {
			int[] a = new int[n + 1];
			for (int i = 1; i < n + 1; i++)
				a[i] = nextInt();
			return a;
		}

		long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		long[] nextLongArrayOne(int n) {
			long[] a = new long[n + 1];
			for (int i = 1; i < n + 1; i++)
				a[i] = nextLong();
			return a;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	public static void main(String[] args) {
		FastReader s = new FastReader();
		StringBuilder str = new StringBuilder();

		int t = s.nextInt();

		while (t-- > 0) {
			char arr[] = s.nextLine().toCharArray();
			int n = arr.length;
			int i = Integer.MIN_VALUE, j = Integer.MIN_VALUE;
			boolean f = true;
			
			for(int k = 0; k < n; k++) {
				
				if(arr[k] == 'a') {
					i = k - 1;
					j = k + 1;
					break;
				}
			}
			
			if(i == Integer.MIN_VALUE) {
				str.append("NO\n");
				continue;
			}
			
			char nxt = 'b';
			
			while(i >= 0 || j < n) {
				boolean moved = false; 
				
				if(i >= 0 && j < n) {
					if(arr[i] == nxt) {
						i--;
						moved = true;
					}else if(arr[j] == nxt) {
						j++;
						moved = true;
					}
					
					nxt = (char)(nxt + 1);
					
					if(!moved) {
						f = false;
						break;
					}
					
					continue;
					
				}
				
				if( i >= 0 && arr[i] == nxt) {
					i--;
					moved = true;
					nxt = (char)(nxt + 1);
					continue;
				}
				
				if(j < n && arr[j] == nxt) {
					j++;
					moved = true;
					nxt = (char)(nxt + 1);
					continue;
				}
				
				if(!moved) {
					f = false;
					break;
				}
				
			}
			
			if(f) {
				str.append("YES\n");
			}else {
				str.append("NO\n");
			}
			
			
			
		}
		System.out.println(str);
	}

}
