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: Wrong Answer)

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#pragma warning(disable : 4996) //_CRT_SECURE_NO_WARNINGS
#define row 3
#define col 3
int main(void) {
	int list[3][3];
	int n, res = 0;
	int* data;
	//make binngo
	for (int i = 0;i < row;i++) {
		for (int k = 0;k < col;k++) {
			scanf("%d", &list[i][k]);
		}
	}
	scanf("%d", &n);
	data = (int*)malloc(sizeof(int) * n);
	for (int i = 0;i < n;i++) {
		scanf("%d", &data[i]);
	}
	//compare list with data
	for (int i = 0;i < row;i++) {
		for (int k = 0;k < col;k++) {
			for (int j = 0;j < n;j++) {
				if (list[i][k] == data[j]) {
					list[i][k] = 0;
				}
			}
		}
	}
	/*横探索*/
	for (int i = 0;i < row;i++) {
		for (int k = 0;k < col;k++) {
			if (list[i][k] != 0) {
				res = 0;/*探索が失敗したら初期化*/
				break;
			}
			else {
				res += 1;
			}
		}
		if (res == 3) {
			puts("Yes");
			break;
		}
	}
	if (res == 3) {
		free(data);
		data = NULL;
		return 0;
	}
	else {
		res = 0;/*初期化*/
		/*縦探索*/
		for (int i = 0;i < col;i++) {
			for (int k = 0;k < row;k++) {
				if (list[k][i] != 0) {
					res = 0;/*探索が失敗したら初期化*/
					break;
				}
				else {
					res += 1;
				}
			}
			if (res == 3) {
				puts("Yes");
				break;
			}
		}
	}
	if (res == 3) {
		free(data);
		data = NULL;
		return 0;
	}
	else {
		res = 0;/*初期化*/
		/*斜め探索*/
		for (int i = 0;i < row;i++) {
			if (list[i][i] != 0) {
				res = 0;/*探索が失敗したら初期化*/
				break;
			}
			else {
				res += 1;
			}
		}
	}
	if (res == 3) {
		puts("Yes");
		free(data);
		data = NULL;
		return 0;
	}
	else {
		res = 0;/*初期化*/
		/*斜め探索*/
		for (int i = 2;i >= 0;i--) {
			for (int k = 0;k < row;k++)
				if (list[i][k] != 0) {
					res = 0;/*探索が失敗したら初期化*/
					break;
				}
				else {
					res += 1;
				}
		}
	}
	if (res == 3) {
		puts("Yes");
		free(data);
		data = NULL;
		return 0;
	}
	else {
		puts("No");
		free(data);
		data = NULL;
		return 0;
	}
}