Milly is playing with a Array A of size N. She wants to make all the values of A to be equal. She can multiply any value any number of times by X, Y and Z. Your task is to tell her whether she can do it or not. Print "She can" if she can do it else print "She can't" without "".

### Input

- First line of the input will contain T (No. of test cases).
- For each test case, first line will contain four space separated integers denoting N, X, Y and Z. Then next line will contain N space separated integers of A

### Output

- For every test case, print the required answer in a new line.

### Constraints

- 1 ≤ T ≤ 5
- 2 ≤ N ≤ 10
^{5} - X, Y, Z ∈ {2, 3, 5, 7}
- 1 ≤ A
_{i}≤ 10^{9}

Explanation

Test case #1: Multiply first value by 2.

Test case #2: Not possible.

Test case #2: Not possible.

Time Limit: 1.0 sec(s) for each input file.

Memory Limit: 256 MB

Source Limit: 1024 KB

Marking Scheme: Marks are awarded if any testcase passes.

Allowed languages: C, C++, Clojure, C#, Go, Haskell, Java, JavaScript(Rhino), Objective-C, Perl, PHP, Python, Ruby