7642: [CSES Problem Set] Finding Patterns
[Creator : ]
Description
Given a string and patterns, check for each pattern if it appears in the string.
Input
The first input line has a string of length $n$.
The next input line has an integer $k$: the number of patterns. Finally, there are $k$ lines that describe the patterns.
The string and the patterns consist of characters a–z.
The next input line has an integer $k$: the number of patterns. Finally, there are $k$ lines that describe the patterns.
The string and the patterns consist of characters a–z.
Output
For each pattern, print "YES" if it appears in the string and "NO" otherwise.
Constraints
$1≤n≤10^5$
$1 \le k \le 5 \cdot 10^5$
the total length of the patterns is at most $5 \cdot 10^5$
$1 \le k \le 5 \cdot 10^5$
the total length of the patterns is at most $5 \cdot 10^5$
Sample 1 Input
aybabtu
3
bab
abc
ayba
Sample 1 Output
YES
NO
YES