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

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
	    // A11 A12 A13
        // A21 A22 A23
        // A31 A32 A33
        // N b1 b2 ... bn
        // ビンゴカード A が N 個の数列 bn で 1 ビンゴできるなら Yes そうでなければ No
        Scanner sc = new Scanner(System.in);
        int[] bingoNum = {sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt()};
        boolean[] hitArray = {false, false, false, false, false, false, false, false, false};
        int numNum = sc.nextInt();
        for(int i = 0; i < numNum; i++) {
            int tempNum = sc.nextInt();
            for (int j = 0; j < 9; j++) {
                if (bingoNum[j] == tempNum) {
                    hitArray[j] = true;
                }
            }
        }
        boolean resR1 = hitArray[0] & hitArray[1] & hitArray[2];
        boolean resR2 = hitArray[3] & hitArray[4] & hitArray[5];
        boolean resR3 = hitArray[6] & hitArray[7] & hitArray[8];
        boolean resR4 = hitArray[0] & hitArray[3] & hitArray[6];
        boolean resR5 = hitArray[1] & hitArray[4] & hitArray[7];
        boolean resR6 = hitArray[2] & hitArray[5] & hitArray[8];
        boolean resR7 = hitArray[0] & hitArray[4] & hitArray[8];
        boolean resR8 = hitArray[2] & hitArray[4] & hitArray[6];
        if(resR1 || resR2 || resR3 || resR4 || resR5 || resR6 || resR7 || resR8){
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}