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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

    import java.util.ArrayDeque;
    import java.util.ArrayList;
    import java.util.Arrays;
    import java.util.Deque;
    import java.util.List;
    import java.util.Scanner;

    public class Main {

        public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int [][] arrys_bingo;
        arrys_bingo = new int [4][4];

        String strs="No";

        int [][] arrys_bingo_result;
        arrys_bingo_result = new int [4][4];


        for(int i=1;i<=3;i++){
            for(int j=1;j<=3;j++){arrys_bingo[i][j]=sc.nextInt();}
        }

        int N = sc.nextInt();
        int [] arrys_n;
        arrys_n = new int [N+1];
        for(int i=1;i<=N;i++){
        arrys_n[i] = sc.nextInt();
        }

        //ビンゴ結果
        for(int i=1;i<=3;i++){
            for(int j=1;j<=3;j++){
                arrys_bingo_result[i][j]=0;
                for(int k=1;k<=N;k++){
                    if(arrys_bingo[i][j]==arrys_n[k]){
                        arrys_bingo_result[i][j]=1;
                    }
                }
            }
        }

        int [] tatekakka;
        tatekakka = new int [4];
        int [] yokokekka;
        yokokekka = new int [4];
        int nanamekekka=1;
        int nanamekekkaa=1;

        //ビンゴ判定1
        for(int i=1;i<=3;i++){
        yokokekka[i]=1;
            for(int j=1;j<=3;j++){
                if(arrys_bingo_result[i][j]==0){
                    yokokekka[i]=0;
                }
            }
        }
        //ビンゴ判定2
        for(int i=1;i<=3;i++){
        tatekakka[i]=1;
            for(int j=1;j<=3;j++){
                if(arrys_bingo_result[j][i]==0){
                    tatekakka[i]=0;
                }
            }
        }
        //ビンゴ判定3
        for(int i=1;i<=3;i++){
                if((arrys_bingo_result[i][i]==0)){
                    nanamekekka=0;
                }
        }
        //ビンゴ判定4
        for(int i=1;i<=3;i++){
                if((arrys_bingo_result[i][4-i]==0)){
                    nanamekekkaa=0;
                }
        }
        for(int i=1;i<=3;i++){
            if((yokokekka[i]==1)||(tatekakka[i]==1)||(nanamekekka==1)||(nanamekekkaa==1)){
            strs="yes";
            }
        }
        System.out.println(strs);
        }
    }