Given a long text t and n strings , you are asked to check for each of the strings if they are a substring of t.
If you need to increase the probability that the two substrings are actually equal to each other using hashes, you might consider calculating several hashes using different prime numbers and different modulo numbers to make sure the hashes are actually equal.
This way, you’d compare a tuple of hashes to another tuple of hashes.
The first line of the input contains the text t (1 ≤ |t| ≤ ).
The next line contains a single integer n (1 ≤ n ≤ ).
The next n lines contain strings (1 ≤ || ≤ min(50, |t|)).
The program should print n lines. Each line should contain Yes if the corresponding string is a substring of t, and No otherwise.