Wildcard

Time Limit: 1000ms
Memory Limit: 65536KB
This problem will be judged on HDU. Original ID: 3901
64-bit integer IO format: %I64d      Java class name: Main

Description

When specifying file names (or paths) in DOS, Microsoft Windows and Unix-like operating systems, the asterisk character (“*") substitutes for any zero or more characters, and the question mark (“?") substitutes for any one character.
Now give you a text and a pattern, you should judge whether the pattern matches the text or not.

Input

There are several cases. For each case, only two lines. The first line contains a text, which contains only lower letters. The last line contains a pattern, which consists of lower letters and the two wildcards (“*", "?").
The text is a non-empty string and its size is less than 100,000, so do the pattern.

We ensure the number of “?” and the number of “*” in the pattern are both no more than 10.

Output

Output “YES” if the pattern matches the text, otherwise “NO”.

Sample Input

abcdef
a*c*f

Sample Output

YES

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .