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.Scanner;

public class Main {

	public static boolean column(boolean T[][]) {
		for (int i = 0; i < 3; i++) {
			if (T[i][0] == true && T[i][1] == true && T[i][2] == true) {
				return true;
			}
		}
		return false;

	}

	public static boolean row(boolean T[][]) {
		for (int i = 0; i < 3; i++) {
			if (T[0][i] == true && T[1][i] == true && T[2][i] == true) {
				return true;
			}
		}
		return false;

	}

	public static boolean dia(boolean T[][]) {
		if ((T[0][0] == true && T[1][1] == true && T[2][2] == true)
				|| ((T[0][2] == true && T[1][1] == true && T[2][0] == true))) {
			return true;
		}

		return false;

	}

	public static void main(String[] args) {
		int A[][] = new int[3][3];
		boolean T[][] = new boolean[3][3];
		for (int i = 0; i < 3; i++) {
			for (int j = 0; j < 3; j++) {
				T[i][j] = false;
			}
		}
		Scanner sc = new Scanner(System.in);
		for (int i = 0; i < 3; i++) {
			for (int j = 0; j < 3; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		int N = sc.nextInt();
		int count = 0;
		while (count < N) {
			int b = sc.nextInt();
			out: for (int i = 0; i < 3; i++) {
				for (int j = 0; j < 3; j++) {
					if (A[i][j] == b) {
						T[i][j] = true;
						break out;
					}

				}
			}
			count++;
		}

		boolean bo = false;
		//		if (N > 6) {
		//			bo = true;
		//		} else {
		//縦
		bo = column(T);
		//横
		bo = row(T);
		//斜め
		bo = dia(T);
		//		}
		if (bo == false) {
			System.out.println("No");
		} else {
			System.out.println("Yes");
		}

	}
}