A10645 | Cipher

Input data contains multiple test cases. The first line of input contains $t$ ( $1<=t<=100$ ) — the number of test cases.

Each test case is described as follows. The first line of the description contains $n$ ( $1<=n<=18$ ) — the number of digits in the number. The second line contains $n$ decimal digits without spaces (but possibly with leading zeroes) — the number initially stored in the display computer. The following $n$ lines contain 10 characters each. The $j$ -th character of the $i$ -th of these lines is the code character for a digit $j-1$ in position $i$ , most significant digit positions are described first.

For each test case print an integer: the number of seconds until Borya definitely knows what was the initial number stored on the display of the computer. Do not print leading zeroes.

无