B'Let 's introduce the designation , where x is a string, n is a positive integer and operation " xe2 x80 x89+ xe2 x80 x89" is the string concatenation operation. For example, [abc, xe2 x80 x892] xe2 x80 x89= xe2 x80 x89abcabc. We 'll say that string s can be obtained from string t, if we can remove some characters from string t and obtain string s. For example, strings ab and a xd1 x81ba can be obtained from string xacbac, and strings bx and aaa cannot be obtained from it. Sereja has two strings, w xe2 x80 x89= xe2 x80 x89[a, xe2 x80 x89b] and q xe2 x80 x89= xe2 x80 x89[c, xe2 x80 x89d]. He wants to find such maximum integer p (p xe2 x80 x89> xe2 x80 x890), that [q, xe2 x80 x89p] can be obtained from string w. The first line contains two integers b, d (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89b, xe2 x80 x89d xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89107). The second line contains string a. The third line contains string c. The given strings are not empty and consist of lowercase English letters. Their lengths do not exceed 100. In a single line print an integer -- the largest number p. If the required value of p doesn 't exist, print 0.'...