Codeforces Round #425 (Div. 2) B. Petya and Exam（字符串处理）

B. Petya and Exam

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

It's hard times now. Today Petya needs to score 100 points on Informatics exam. The tasks seem easy to Petya, but he thinks he lacks time to finish them all, so he asks you to help with one..

There is a glob pattern in the statements (a string consisting of lowercase English letters, characters "?" and "*"). It is known that character "*" occurs no more than once in the pattern.

Also, n query strings are given, it is required to determine for each of them if the pattern matches it or not.

Everything seemed easy to Petya, but then he discovered that the special pattern characters differ from their usual meaning.

A pattern matches a string if it is possible to replace each character "?" with one good lowercase English letter, and the character "*" (if there is one) with any, including empty, string of bad lowercase English letters, so that the resulting string is the same as the given string.

The good letters are given to Petya. All the others are bad.

Input

The first line contains a string with length from 1 to 26 consisting of distinct lowercase English letters. These letters are good letters, all the others are bad.

The second line contains the pattern — a string s of lowercase English letters, characters "?" and "*" (1 ≤ |s| ≤ 105). It is guaranteed that character "*" occurs in s no more than once.

The third line contains integer n (1 ≤ n ≤ 105) — the number of query strings.

n lines follow, each of them contains single non-empty string consisting of lowercase English letters — a query string.

It is guaranteed that the total length of all query strings is not greater than 105.

Output

Print n lines: in the i-th of them print "YES" if the pattern matches the i-th query string, and "NO" otherwise.

You can choose the case (lower or upper) for each letter arbitrary.

Examples

input

ab
a?a
2
aaa
aab

output

YES
NO

input

abc
a?a?a*
4
abacaba
abaca
apapa
aaaaax

output

NO
YES
NO
YES

Note

In the first example we can replace "?" with good letters "a" and "b", so we can see that the answer for the first query is "YES", and the answer for the second query is "NO", because we can't match the third letter.

Explanation of the second example.

• The first query: "NO", because character "*" can be replaced with a string of bad letters only, but the only way to match the query string is to replace it with the string "ba", in which both letters are good.
• The second query: "YES", because characters "?" can be replaced with corresponding good letters, and character "*" can be replaced with empty string, and the strings will coincide.
• The third query: "NO", because characters "?" can't be replaced with bad letters.

• The fourth query: "YES", because characters "?" can be replaced with good letters "a", and character "*" can be replaced with a string of bad letters "x".

题意：问号处可以被任意好字母替代，星号处只能被一个或多个坏字母替代或者空替代，问能不能有个正确的结果。

题意很简单，直接看代码对字符串处理。

#include<bits/stdc++.h>
#define eps 1e-9
#define PI 3.141592653589793
#define bs 1000000007
#define bsize 256
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
using namespace std;
string ch,yuan;
char q[100005],s[100005];
int book[200];
int cmp(char c,char c2)
{
	if(c==c2)
	return 1;
	if(c=='?'&&book[c2])
	return 1;
	return 0;
}
int main()
{
	int i,k,j,n,len,len1;
	cin>>ch;
	for(i=0;i<ch.size();i++)
	book[ch[i]]=1;
	scanf("%s %d",s,&n);
	len=strlen(s);
	for(i=0;i<n;i++)
	{
		int flog=1;
		int now=0;
		getchar();
		scanf("%s",q);
		len1=strlen(q);
		if(len1<len-1)
		flog=0;
		else
		{
			for(k=0;k<len;k++)
			{
				if(s[k]=='*')
				{
					if(len1==len-1)
					continue;
					else
					{
						for(j=0;j<=len1-len;now++,j++)
						if(book[q[now]])
						flog=0;
					}	
				}
				else
				{
					if(!cmp(s[k],q[now]))
					{
						flog=0;
						break;	
					}
					now++;
				}
			}
			if(now!=len1)
			flog=0;
		}
		if(flog)
		cout<<"YES"<<endl;
		else
		cout<<"NO"<<endl;
	}
	return 0;
 }