UJGOI participants are afraid of the head of UJGOI, so they invented a cypher to hide their messages from him. Cypher is simple — they generate distinct numbers and assign exactly one for each English letter. Now, when they communicate, they use it to encode their messages.
The head of UJGOI can secretly view their messages, but doesn't know the cypher. He is curious to know whether his name appears in messages or not; for example, if his name was "ILLIA", one way it could be encrypted using the cypher is [1,\ 2,\ 2,\ 1,\ 3] (here, stands for "I", for "L", for "A"), so if he sees this subsequence in the message he knows it could be his name.
Given his name and an encrypted message, he wants to find out whether it's possible that his name appears in the message. In other words, whether there exists a sequence of integers such that if the -th letter of the English alphabet in his name is replaced with the -th of these integers, it would appear as a substring of the message.
Additionally, if there does, output the sequence of integers representing the cypher.
The first line of the input contains two integers (1 \leq n \leq 10^3) and (1 \leq m \leq 10) — length of the message and length of the name.
The second line contains integers a_1, a_2, \dots, a_n (1 \leq a_i \leq 26) — the message encoded with a cypher. It is guaranteed that there are at most unique integers.
The third line contains a string of in uppercase English letters, the name of the head of UJGOI.
In the first line, output a single string — "Yes" or "No", answering whether there exists such a cypher that the name encoded with it appears in the message.
Additionally, if the answer is "Yes", output integers c_1, c_2, c_3, \dots, c_{26} (1 \leq c_i \leq 26), with c_k representing the integer that encodes the -th letter of the Latin alphabet.
For each 1 \le i < j \le 26, c_i \neq c_j must hold.
Example 1
Example 2
Example 3
In the first test, encoding the name "ANTON" with the cypher [1, 2, 3, \dots, 26] we get [1, 14, 20, 15, 14] which appears as a substring of the message starting at position .
In the second test, encoding the name "ILLIA" with the cypher from output, we get [1, 2, 2, 1, 3], which is the message itself.
In the third test, it's easy to see that there doesn't exist a cypher that would turn "AKSHAD" into equal integers.