Problem Statement

Taro the First and Jiro the Second bought a rectangular cake as a present for their mother. They were hungry, so they decided to eat all of the cake except for one piece for their mother.

There is a cake consisting of pieces arranged in $N$ rows and $M$ columns. The piece at the $i$-th row from the top and $j$-th column from the left has a strawberry on it when $s_{i,j}$ is 1, and does not have a strawberry when it is 0.

Starting with Taro the First, the two alternately perform an operation on the cake until only one piece remains. The operations they can perform are as follows. However, they cannot perform an operation that eats all remaining pieces.

• Eat all pieces in the first row from the top
• Eat all pieces in the first row from the bottom
• Eat all pieces in the first column from the left
• Eat all pieces in the first column from the right

Taro the First wants to leave a piece with a strawberry, and Jiro the Second wants to leave a piece without a strawberry. Determine whether Taro the First can leave a piece with a strawberry no matter how Jiro the Second operates, when Taro operates appropriately.

You are given $T$ test cases; find the answer for each of them.

Constraints

• $1 \le T \le 10^5$
• $1 \le N,M \le 10^{3}$
• $1<NM$
• $s_{i}$ is a string of length $M$ consisting of 0 and 1.
• The sum of $NM$ over all test cases is at most $10^6$.

Input

The input is given from Standard Input in the following format:

T
\text{case}_1
\text{case}_2
\vdots
\text{case}_T

Each test case is given in the following format:

N M
s_1
s_2
\vdots
s_N

Output

Print $T$ lines.

On the $i$-th line, for the $i$-th test case, print First if Taro the First can leave a piece with a strawberry no matter how Jiro the Second operates when Taro operates appropriately, and Second otherwise.