CF716B.Complete the Word

ZS the Coder loves to read the dictionary. He thinks that a word is nice if there exists a substring (contiguous segment of letters) of it of length 26 where each letter of English alphabet appears exactly once. In particular, if the string has length strictly less than 26, no such substring exists and thus it is not nice.

Now, ZS the Coder tells you a word, where some of its letters are missing as he forgot them. He wants to determine if it is possible to fill in the missing letters so that the resulting word is nice. If it is possible, he needs you to find an example of such a word as well. Can you help him?

ZS 这位程序员很喜欢查阅字典。他认为一个单词是“优美的”，当且仅当该单词中存在一个长度为 26 的子串（即连续的一段字母），其中英文字母表中的每个字母恰好出现一次。特别地，若字符串长度严格小于 26，则不存在这样的子串，因此该字符串不是优美的。

现在，ZS 这位程序员告诉你一个单词，其中部分字母缺失了（因为他忘记了）。他希望你判断：是否有可能将这些缺失的字母填上，使得最终得到的单词是优美的？如果可能，请你给出一个满足条件的填法示例。你能帮助他吗？

The first and only line of the input contains a single string s (1 ≤ |s| ≤ 50 000), the word that ZS the Coder remembers. Each character of the string is the uppercase letter of English alphabet ('A'-'Z') or is a question mark ('?'), where the question marks denotes the letters that ZS the Coder can't remember.

输入仅有一行，包含一个字符串 $s$（$1 ≤ |s| ≤ 50\,000$），即 ZS the Coder 所记得的单词。该字符串的每个字符均为英文字母的大写形式（'A'–'Z'）或问号（'?'），其中问号表示 ZS the Coder 记不清的字母。

If there is no way to replace all the question marks with uppercase letters such that the resulting word is nice, then print  - 1 in the only line.

Otherwise, print a string which denotes a possible nice word that ZS the Coder learned. This string should match the string from the input, except for the question marks replaced with uppercase English letters.

If there are multiple solutions, you may print any of them.

如果无法将所有问号替换为大写字母，使得得到的单词是“优美”的，则在唯一的一行中输出 -1。

否则，请输出一个可能的“优美”单词，即 ZS the Coder 学到的那个单词。该字符串应与输入字符串一致，仅将问号替换为大写英文字母。

若存在多个解，输出任意一个即可。

In the first sample case, ABCDEFGHIJKLMNOPQRZTUVWXYS is a valid answer beacuse it contains a substring of length 26 (the whole string in this case) which contains all the letters of the English alphabet exactly once. Note that there are many possible solutions, such as ABCDEFGHIJKLMNOPQRSTUVWXYZ or ABCEDFGHIJKLMNOPQRZTUVWXYS.

In the second sample case, there are no missing letters. In addition, the given string does not have a substring of length 26 that contains all the letters of the alphabet, so the answer is  - 1.

In the third sample case, any string of length 26 that contains all letters of the English alphabet fits as an answer.

在第一个样例中，字符串 ABCDEFGHIJKLMNOPQRZTUVWXYS 是一个合法的答案，因为它包含一个长度为 26 的子串（本例中即整个字符串），该子串恰好包含英语字母表中的全部 26 个字母各一次。注意，存在多种可能的解，例如 ABCDEFGHIJKLMNOPQRSTUVWXYZ 或 ABCEDFGHIJKLMNOPQRZTUVWXYS。

在第二个样例中，给定字符串中没有缺失字母；此外，它也不包含任何长度为 26 且涵盖字母表全部字母的子串，因此答案为 $-1$。

在第三个样例中，任意一个长度为 26 且包含英语字母表全部字母的字符串均可作为答案。