H. Delete Them

// Problem: H. Delete Them
// Contest: Codeforces - 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)
// URL: https://codeforces.com/problemset/problem/730/H
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 2022-03-14 10:19:14
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
void solve() {
	string s[110];
	bool st[110] = {0};
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i ++) {
		cin >> s[i];
		st[i] = 1;
	}
	for (int i = 1; i <= m; i ++) {
		int id;
		cin >> id;
		st[id ] = 0;
	}
	vector<string> ans;
	for (int i = 1; i <= n; i ++) {
		if (!st[i]) 
			ans.pb(s[i]);
	}
	int len = ans[0].size();
	for (int i = 0; i < m; i ++) {
		if (len != ans[i].size()){
			puts ("No");
			return;
		}
	}
	
	
	string ss = "";
	for (int i = 0; i < len; i ++) {
		bool f = 1;
		char ch = ans[0][i];
		for (int j = 0;j  < m; j ++) {
			if (ch != ans[j][i]) {
				f = 0;
				
			}
		}
		if (f)
			ss += ch;
		else {
			ss += "?";
		}
	}
	for (int i = 1; i <= n; i ++) {
		if (st[i]) {
			if (ss.size() != s[i].size()) continue;
			bool f = 0;
			for (int j = 0; j < ss.size(); j ++) {
				if (ss[j] == '?' || ss[j] == s[i][j]) {
					
				}
				else f = 1;
			}
			if (!f) {
				puts("No");
				
				return;
			}
		}
	}
	puts("Yes");
	cout << ss << endl;
	
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

要求删除一些字符串，构造一个删除模式要求这个模式与被删除的字符串匹配，与其他的不匹配.判断是否存在如果存在就输出。否则输出No