Problem:
Score : 200 points

Problem Statement

We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.

The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.

Determine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.

Constraints

All values in input are integers.

1 \leq A_{i, j} \leq 100

A_{i_1, j_1} \neq A_{i_2, j_2} ((i_1, j_1) \neq (i_2, j_2))

1 \leq N \leq 10

1 \leq b_i \leq 100

b_i \neq b_j (i \neq j)

Input

Input is given from Standard Input in the following format:

A_{1, 1} A_{1, 2} A_{1, 3}
A_{2, 1} A_{2, 2} A_{2, 3}
A_{3, 1} A_{3, 2} A_{3, 3}
N
b_1
\vdots
b_N

Output

If we will have a bingo, print Yes; otherwise, print No.

Sample Input 1

84 97 66
79 89 11
61 59 7
7
89
7
87
79
24
84
30

Sample Output 1

Yes

We will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.

Sample Input 2

41 7 46
26 89 2
78 92 8
5
6
45
16
57
17

Sample Output 2

No

We will mark nothing.

Sample Input 3

60 88 34
92 41 43
65 73 48
10
60
43
88
11
48
73
65
41
92
34

Sample Output 3

Yes

We will mark all the squares.

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

process.stdin.resume();
process.stdin.setEncoding('utf8');

// 標準入力取込
var g_input = '';
process.stdin.on('data', function(chunk) {
    g_input += chunk;
});
process.stdin.on('end', function() {
    main(g_input.split(/\r?\n/));
});

// 解答
function main(inputs){

    // ビンゴカード
    var bingoCard = [inputs[0].split(" "), inputs[1].split(" "), inputs[2].split(" ")];
    var hit = [[0,0,0],[0,0,0],[0,0,0]];
    // 選ばれた数
    var selectedNum = inputs[3];

    // 選ばれた数値の当たり判定
    for (var i = 0; i < selectedNum; i++) {

        if (bingoCard[0].indexOf(inputs[i + 4]) != -1) {

            hit[0][bingoCard[0].indexOf(inputs[i + 4])] = 1;
        } else if (bingoCard[1].indexOf(inputs[i + 4]) != -1) {

            hit[1][bingoCard[1].indexOf(inputs[i + 4])] = 1;
        } else if (bingoCard[2].indexOf(inputs[i + 4]) != -1) {

            hit[2][bingoCard[2].indexOf(inputs[i + 4])] = 1;
        }
    }

    // ビンゴ判定
    if (hit[0][0] + hit[0][1] + hit[0][2] === 3
       || hit[1][0] + hit[1][1] + hit[1][2] === 3
       || hit[2][0] + hit[2][1] + hit[2][2] === 3
       || hit[1][0] + hit[1][0] + hit[1][0] === 3
       || hit[0][1] + hit[1][1] + hit[2][1] === 3
       || hit[0][2] + hit[1][2] + hit[2][2] === 3
       || hit[0][0] + hit[1][1] + hit[2][2] === 3
       || hit[0][2] + hit[1][1] + hit[2][0] === 3) {

        console.log('Yes');
    } else {

        console.log('No');
    }
}