MAIN8_E  Cover the string
Given two strins A and B. You have to find the length of the smallest substring of A, such that B is the subsequence of this substing.
Formally speaking
you have to find the lenght of smallest possible string S such that
S is the substring of A
B is the subsequence S
Note: Subsequence of an string S is obtained by deletnig some (possibly none) of the characters from it. for example "ah" is the subsequecne of "aohol"
Given two strins A and B. You have to find the length of the smallest substring of A, such that B is the subsequence of this substing.
Formally speaking
you have to find the lenght of smallest possible string S such that
S is the substring of A
B is the subsequence S
Note: Subsequence of an string S is obtained by deletnig some (possibly none) of the characters from it. for example "ah" is the subsequecne of "aohol"
Input
First line contains T, the number of test cases. Then T test cases follow, 2 lines for each test case, 1st contains A and 2nd contain B.
A<=20000, B<=100
Output
For each test case print the answer in a new line. if no such substring exists print 1 instead.
Example
Input: 2 aaddddcckhssdd acs ghkkhllhjkhthkjjht hh Output: 10 3
hide comments
sandeep pandey:
20110424 10:53:48
is it possible to accept d O[N^2] solution??


Azamat Ahmedov:
20110424 04:19:49
Max(T)=? 
Added by:  Mahesh Chandra Sharma 
Date:  20110420 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own problem used for NSITIIITA Main contest #8 