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: Accepted)

"use strict";
    
const main = arg => {
    arg = arg.trim().split("\n");
    const A1 = arg[0].split(" ").map(n=>parseInt(n));
    const A2 = arg[1].split(" ").map(n=>parseInt(n));
    const A3 = arg[2].split(" ").map(n=>parseInt(n));
    const N  = arg[3];
    const B  = arg.slice(4, N + 3).map(n=>parseInt(n));
    
    let as = [A1, A2, A3];
    
    for(let i in B) {
        for(let j in as) {
            let del = as[j].indexOf(B[i]);
            
            if(del !== -1) {
                as[j][del] = "x";
            }   
        }
        
        const vert1 = [A1[0], A2[0], A3[0]]; 
        const vert2 = [A1[1], A2[1], A3[1]]; 
        const vert3 = [A1[2], A2[2], A3[2]]; 
        
        const cross1 = [A1[0], A2[1], A3[2]];
        const cross2 = [A3[0], A2[1], A1[2]];
    
        let temp = [A1, A2, A3, vert1, vert2, vert3, cross1, cross2];
        
        for(let j in temp) {
            if(temp[j].filter(n=>n === "x").length === temp[j].length) {
                console.log("Yes");
                return;
            }
        }
    }
    
    console.log("No");
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));