One day going through some old books, our hacker, Little Stuart finds something scribbled on the corner of a page.
Now he believes that the scribbled text is more mysterious than it originally looks, so he decides to find every occurrence of all the permutations of the scribbled text in the entire book. Since this is a huge task, Little Stuart needs your help, he needs you to only figure out if any permutation of the scribbled text exists in the given text string, so he can save time and analyze only those text strings where a valid permutation is present.
The first line contains scribbled text and
Next line contains a text string.
All characters in both the strings are in lowercase only [a-z].
Print YES or NO depending on whether any permutation of the pattern exists in the text string.
use -- Scribbled text
question -- Text string