Permutation in String Problem Statement

Determine if the string str2 contains a permutation of the string str1 as one of its substrings.

Input:

The first line contains an integer 'T', representing the number of test cases. For each test case, the first line contains two space-separated integers, 'N' and 'M', indicating the lengths of 'str1' and 'str2'. The second line contains the strings 'str1' and 'str2'.

Output:

For each test case, print "Yes" if any permutation of "str1" is a substring of "str2". Otherwise, print "No".

Example:

Input:

str1 = "ab", str2 = "aoba"

Output:

Yes

Explanation:

The permutations of "ab" are ["ab", "ba"]. The substring "ba" is found in "aoba".

Constraints:

• 1 <= T <= 100
• 1 <= N <= 5000
• 1 <= M <= 5000
• Time limit: 1 second

Note:

No printing of the result is needed; implement the function to return the answer.