Pattern Search in Strings

Given two strings S and P consisting of lowercase English alphabets, determine if P is present in S as a substring.

Input:

The first line contains an integer T, the number of test cases.
Each test case consists of a single line with two space-separated strings P and S.

Output:

For each test case, output "YES" if P is a substring of S, otherwise output "NO".

Example:

Input:

3
abc abcdef
xyz abcdef
def abcdef

Output:

YES
NO
YES

Constraints:

• 1 <= T <= 100
• 1 <= |S| <= 10000
• 1 <= |P| < |S|

Note:

You are not required to print anything; the output is managed by the system. Implement the function to return the correct result.