Word Pattern Problem Statement

Given two strings S and T, determine if S follows the same pattern as T.

A full match means there is a bijection between a letter of T and a non-empty word of S.

Example:

Input:

S = "lion cow cow lion"
T = "wccw"

Output:

Yes

Explanation:

The string S follows the same pattern as string T.

Constraints:

• 1 <= t <= 100
• 1 <= |S| <= 5000
• 1 <= |T| <= 5000
• Time Limit: 1 second

Input:

The first line contains an integer 't' denoting the number of test cases.
Each test case consists of two lines:
The first line contains the string 'S'.
The second line contains the string 'T'.

Output:

For each test case, print "Yes" if 'S' follows the same pattern as 'T', otherwise print "No".

Note:

'T' contains only lowercase English letters.
'S' contains only lowercase English letters and spaces.
'S' does not contain any trailing or leading spaces, and all words in 'S' are separated by a single space.