Xsquare loves to play with strings a lot. Today, he has two strings S₁ and S₂ both consisting of lower case alphabets. Xsquare listed all subsequences of string S₁ on a paper and all subsequences of string S₂ on a separate paper. Xsquare wants to know whether there exists a string which is listed on both the papers.

Xsquare thinks that this task is pretty boring and handed it to you. Please accomplish this task on his behalf.

Input

First line of input contains a single integer T denoting the number of test cases. Each test case consists of two lines. First line of each test case contains a string denoting string S₁. Next line of each test case contains a string denoting string S₂.

Output

For each test case, Print Yes if both papers contain a common string otherwise Print No.

Constraints

1 ≤ T ≤ 10⁵

1 ≤ |S₁| ≤ 10⁵

1 ≤ |S₂| ≤ 10⁵

Sum of |S₁| over all test case does not exceed 5*10⁵

Sum of |S₂| over all test case does not exceed 5*10⁵

Subtasks

Subtask1 : sum of |S₁|,|S₂| over all test cases does not exceed 10³ (25 pts)
Subtask2 : sum of |S₁|,|S₂| over all test cases does not exceed 10⁴ (25 pts)
Subtask3 : sum of |S₁|,|S₂| over all test cases does not exceed 5*10⁵ (50 pts)