Description

You have n strings s₁, s₂, ..., s_n, where the strings are combination of lower case characters.  You are going to perform q operations.  Each operation is in the following format:

1. E i j: Check if s_i and s_j are identical?
2. C i j: Update s_i to be the concatenation of s_i and s_j.  For example, if s_i =  "star" and s_j = "burst", then the concatenation of s_i and s_j will be "starburst".

Input

The first line contains integer n and q.

The following n lines are the strings, with the i-th line containing s_i.

The following q lines are the queries described in the problem description.

Constraints

• 1 ≤ n, q ≤ 100
• Length sum of all strings ≤ 5000
• Length of each string after concatenation ≤ 5000

Output

For each operation `E i j`, please output 'Y' if s_i and s_j are identical, 'N' otherwise.

Sample Input  Download

Sample Output  Download

Tags

Discuss