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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int[][] bingo = new int[3][3];
            bingo[0] = CPUtils.readIntArray(3, in);
            bingo[1] = CPUtils.readIntArray(3, in);
            bingo[2] = CPUtils.readIntArray(3, in);
            int N = in.nextInt();
            int nums[] = CPUtils.readIntArray(N, in);
            Arrays.sort(nums);
            boolean answer = false;

            for (int row = 0; row < 3; row++)
            {
                int cnt = 0;
                for (int col = 0; col < 3; col++)
                {
                    int found = Arrays.binarySearch(nums, bingo[row][col]);
                    if (found >= 0) cnt++;
                }
                if (cnt == 3) answer = true;
            }
            for (int row = 0; row < 3; row++)
            {
                int cnt = 0;
                for (int col = 0; col < 3; col++)
                {
                    int found = Arrays.binarySearch(nums, bingo[col][row]);
                    if (found >= 0) cnt++;
                }
                if (cnt == 3) answer = true;
            }

            int el0_0 = bingo[0][0];
            int el1_1 = bingo[1][1];
            int el2_2 = bingo[2][2];
            if (Arrays.binarySearch(nums, el0_0) >= 0 && Arrays.binarySearch(nums, el1_1) >= 0 && Arrays.binarySearch(nums, el2_2) >= 0)
                answer = true;

            el0_0 = bingo[0][2];
            el1_1 = bingo[1][1];
            el2_2 = bingo[2][0];

            if (Arrays.binarySearch(nums, el0_0) >= 0 && Arrays.binarySearch(nums, el1_1) >= 0 && Arrays.binarySearch(nums, el2_2) >= 0)
                answer = true;

            if (answer)
                out.print("Yes");
            else
                out.print("No");
        }

    }

    static class CPUtils
    {
        public static int[] readIntArray(int size, Scanner in)
        {
            int[] array = new int[size];
            for (int i = 0; i < size; i++)
            {
                array[i] = in.nextInt();
            }
            return array;
        }

    }
}