SP665 SUBS - String it out

Let **A** and **B** be two strings made up of alphabets such that **A = A $ _{[1-n]} $ , B = B $ _{[1-m]} $** . We say **B** is a subsequence of **A** if there exists a sequence of indices **i $ _{1} $ < i $ _{2} $

- The first line of the input contains a positive integer **t

The output must contain **t** lines, each line corresponding to a test case. The value on the **k $ ^{th} $** line should be the value of **M** for the **k $ ^{th} $** pair of **X** and **Y**.