Given two strings and , and a number , where is the pattern and is the text in which we will search for . It is known that the suffix of string , starting at position , is not longer than the length of string . Perform a character-by-character comparison from left to right to determine if the pattern is contained within the text , starting from position .
The first line of input contains the pattern . The second line contains the text (1 \leq \text{size}(T) \leq 100). The third line contains the integer .
Print YES on the first line if the text contains the pattern starting from position ; otherwise, print NO. On the second line, print the number of comparisons performed.
Example 1
Example 2