As we know, Vineeth is a very naughty nerd. One day he had to delete his browser history. As there was plenty of links to delete, He came up with an idea of creating a special String that had the capability of deleting the required links and he named such String as "Naughty String".

As there were totally n links in his browser and he needs to delete some of them. All the required links should only match the pattern of Naughty String.

The only special character Vineeth knows is a question mark '?' which matches any single character. All other characters in the Naughty String match themselves only.

Formally, a Naughty String matches a link if and only if they have equal lengths and all characters in the corresponding positions are equal except when the character in the Naughty String is '?', in which case the corresponding link character does not matter.

For example, the link pattern "a?ba?":

matches links "aabaa", "abba.", "a.ba9" and "a.ba."
does not match links "aaba", "abaab", "aabaaa" and "aabaa."
Help Vineeth find a Naughty String or report if there is no such String.

INPUT :

The first line of the input contains two integers n and m (1 ≤ m ≤ n ≤ 100) — the total number of links and the number of links to be deleted.

The following n lines contain links, single link per line. All links are non-empty strings containing only lowercase English letters, digits and dots ('.'). The length of each link doesnt exceed 100. It is guaranteed that all links are distinct.

The last line of the input contains m distinct integer numbers in ascending order a1, a2, ..., am (1 ≤ ai ≤ n) — indices of links to be deleted. All links are indexed from 1 to n in order of their appearance in the input.

OUTPUT:

If the required Naughty String exists, print "Yes" in the first line of the output. The second line should contain the required Naughty String.

If the required Naughty String doesnt exist, print the only line containing "No"

The created Naughty String must contain minimum number of '?' (Special Character)