18744번 - Cat 다국어

How many distinct strings can be obtained by concatenating a non-empty suffix of string a with a non-empty prefix of string b?

The first line contains a single integer t (1 ≤ t ≤ 10⁵), denoting the number of test cases.

Each test case is described with strings a and b on separate lines. Both strings consist of lowercase English letters and have length between 1 and 10⁵, inclusive.

The total length of strings over all test cases does not exceed 2 · 10⁵.

For each test case, display the required number.

In the first test case, all obtainable strings are abbb, abbbb, abbbba, bb, bbb, bbba, bbbb, bbbba.

In the second test case, only strings consisting of at least 2 and at most 8 letters a can be obtained.