CF1144A.Diverse Strings

A string is called diverse if it contains consecutive (adjacent) letters of the Latin alphabet and each letter occurs exactly once. For example, the following strings are diverse: "fced", "xyz", "r" and "dabcef". The following string are not diverse: "az", "aa", "bad" and "babc". Note that the letters 'a' and 'z' are not adjacent.

Formally, consider positions of all letters in the string in the alphabet. These positions should form contiguous segment, i.e. they should come one by one without any gaps. And all letters in the string should be distinct (duplicates are not allowed).

You are given a sequence of strings. For each string, if it is diverse, print "Yes". Otherwise, print "No".

如果一个字符串包含连续（相邻）的拉丁字母，且每个字母恰好出现一次，则称该字符串是多样化的（diverse）。例如，以下字符串是多样化的：“fced”、“xyz”、“r” 和 “dabcef”。以下字符串不是多样化的：“az”、“aa”、“bad” 和 “babc”。注意，字母 'a' 和 'z' 并不相邻。

形式化地说，考虑字符串中所有字母在字母表中的位置。这些位置应构成一个连续的区间，即它们应依次排列、中间不能有空缺。此外，字符串中的所有字母必须互不相同（不允许重复）。

你将得到一串字符串。对每个字符串，若其为多样化字符串，则输出 "Yes"；否则输出 "No"。

The first line contains integer $n$ ($1 \le n \le 100$), denoting the number of strings to process. The following $n$ lines contains strings, one string per line. Each string contains only lowercase Latin letters, its length is between $1$ and $100$, inclusive.

第一行包含一个整数 $n$（$1 \le n \le 100$），表示需要处理的字符串数量。接下来的 $n$ 行每行包含一个字符串。每个字符串仅由小写拉丁字母组成，其长度在 $1$ 到 $100$ 之间（含端点）。

Print $n$ lines, one line per a string in the input. The line should contain "Yes" if the corresponding string is diverse and "No" if the corresponding string is not diverse. You can print each letter in any case (upper or lower). For example, "YeS", "no" and "yES" are all acceptable.

输出 $n$ 行，每行对应输入中的一个字符串。若该字符串是“多样化的”，则输出“Yes”；否则输出“No”。每个字母可使用任意大小写形式（大写或小写）。例如，“YeS”、“no”和“yES”均被接受。