codeforces H. Delete Them(2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, )

H. Delete Them

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Polycarp is a beginner programmer. He is studying how to use a command line.

Polycarp faced the following problem. There are n files in a directory and he needs to delete some of them. Polycarp wants to run a single delete command with filename pattern as an argument. All the files to be deleted should match the pattern and all other files shouldn't match the pattern.

Polycarp doesn't know about an asterisk '*', the only special character he knows is a question mark '?' which matches any single character. All other characters in the pattern match themselves only.

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

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

• matches filenames "aabaa", "abba.", "a.ba9" and "a.ba.";
• does not match filenames "aaba", "abaab", "aabaaa" and "aabaa.".

Help Polycarp find a pattern which matches files to be deleted and only them or report if there is no such pattern.

Input

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

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

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

Output

If the required pattern exists, print "Yes" in the first line of the output. The second line should contain the required pattern. If there are multiple solutions, print any of them.

If the required pattern doesn't exist, print the only line containing "No".

Examples

input

3 2
ab
ac
cd
1 2

output

Yes
a?

input

5 3
test
tezt
test.
.est
tes.
1 4 5

output

Yes
?es?

input

4 4
a
b
c
dd
1 2 3 4

output

No

input

6 3
.svn
.git
....
...
..
.
1 2 3

output

Yes
.???

#include<bits/stdc++.h>
using namespace std;
string str[110];
int a[110],len[110],vis[110];
char b[110];
int main()
{
    int n,m;
    while(~scanf("%d %d",&n,&m))
    {
        memset(b,0,sizeof(b));
        memset(len,0,sizeof(len));
        memset(vis,0,sizeof(vis));
        int flag=1;
        for(int i=1; i<=n; i++)
        {
            cin>>str[i];
            len[i]=str[i].size();
        }
        for(int j=0; j<m; j++)
        {
            scanf("%d",&a[j]);
            vis[a[j]]=-1;
        }
        int x,y;
        y=a[0];
        x=len[y];
        for(int j=1; j<m; j++)
        {
            y=a[j];
            if(len[y]!=x)
            {
                flag=0;
                break;
            }
        }
        if(flag==0)
        {
            printf("No\n");
        }
        else
        {
            int s=0;
            int flag1=0;
            y=a[0];
            int len1=len[y];
            for(int i=0; i<len1; i++)
            {
                flag1=0;
                for(int j=1; j<m; j++)
                {
                    x=a[j];
                    if(str[y][i]!=str[x][i])
                    {
                        flag1=1;
                    }
                }
                if(flag1==0)
                {
                    b[s++]=str[y][i];
                }
                else if(flag==1)
                {
                    b[s++]='?';
                }
            }
            int flag2=1;
            int summ=0;
            for(int j=1; j<=n; j++)
            {
                if(vis[j]==0&&len[j]==s)
                {
                    summ=0;
                    for(int k=0; k<s; k++)
                    {
                        if((b[k]==str[j][k])||(b[k]!=str[j][k]&&b[k]=='?'))
                        {
                            summ++;
                        }
                    }
                    if(summ==s)//匹配
                    {
                        flag2=0;
                        break;
                    }
                }
                else if(vis[j]==0&&len[j]!=s)//不匹配
                {
                    continue;
                }
            }
            if(flag2==0)
                printf("No\n");
            else if(flag==1||n==m)
            {
                printf("Yes\n");
                for(int i=0; i<s; i++)
                {
                    if(i!=s-1)
                        printf("%c",b[i]);
                    else
                        printf("%c\n",b[i]);
                }
            }
        }
    }
    return 0;
}