{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Many operations can be performed with strings and a lot of experimenting has already been completed as strings have many interesting uses. Strings manipulation can be used to encrypt and decrypt data, send secret messages, and so on. Finding the longest common subsequence from a string is such a manipulation which is both interesting and challenging at the same time. However, enough of such common problems right? Your task is to find the longest match from a string of multiple words, where instead of matching letter sequence, you will match word sequences.\n\nThe longest match in a string is the maximum number of words that are in the exact sequence as another given string."}},{"title":"Input","value":{"format":"MD","content":"The input contains multiple test cases that are terminated by the end of the file. Each test case has two lines, the first line is the string from where the longest match is to be found, and the second line is the matching string. Each line can be at most 1000 characters long and each word can be at most 20 characters long. The strings can contain any characters, so assume that punctuation marks are equivalent to spaces and separate two words."}},{"title":"Output","value":{"format":"MD","content":"For each test case, print the answer starting with the case number which will be right-justified in a field of two, and then print the longest matching number as given in sample output. If any line of a test case is blank, print only \"Blank!\"."}},{"title":"Sample Input","value":{"format":"MD","content":"```\nHi there\n\nmy name is test\nmy test\n```"}},{"title":"Sample Output","value":{"format":"MD","content":"```\n 1. Blank!\n 2. Length of longest match: 2\n```"}}]}