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 C (Clang 3.8.0) (judge verdict: Accepted)

#include<stdio.h>

int main(void){
	int a11, a12, a13, a21, a22, a23, a31, a32, a33;
	int n11, n12, n13, n21, n22, n23, n31, n32, n33;
	int N;
	int b[100];
	int i;
	int j = 0;

	n11 = 0;
	n12 = 0;
	n13 = 0;
	n21 = 0;
	n22 = 0;
	n23 = 0;
	n31 = 0;
	n32 = 0;
	n33 = 0;

	scanf("%d %d %d", &a11, &a12, &a13);
	scanf("%d %d %d", &a21, &a22, &a23);
	scanf("%d %d %d", &a31, &a32, &a33);
	scanf("%d", &N);

	for (i = 0; i < N; i++){
		scanf("%d", &b[i]);
	}

	for (i = 0; i < N; i++){
		if (a11 == b[i]) n11 = 1;
		if (a12 == b[i]) n12 = 1;
		if (a13 == b[i]) n13 = 1;
		if (a21 == b[i]) n21 = 1;
		if (a22 == b[i]) n22 = 1;
		if (a23 == b[i]) n23 = 1;
		if (a31 == b[i]) n31 = 1;
		if (a32 == b[i]) n32 = 1;
		if (a33 == b[i]) n33 = 1;
	}

	if (n11 == n12 && n12 == n13 && n11 == 1)
		j = 1;

	if (n21 == n22 && n22 == n23 && n21 == 1)
		j = 1;

	if (n31 == n32 && n32 == n33 && n31 == 1)
		j = 1;

	if (n11 == n21 && n21 == n31 && n11 == 1)
		j = 1;

	if (n12 == n22 && n22 == n32 && n12 == 1)
		j = 1;

	if (n13 == n23 && n23 == n33 && n13 == 1)
		j = 1;

	if (n11 == n22 && n22 == n33 && n11 == 1)
		j = 1;

	if (n13 == n22 && n22 == n31 && n13 == 1)
		j = 1;

	if (j == 1){
		printf("Yes\n");
	}
	else{
		printf("No\n");
	}
}