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: Runtime Error)



import java.io.IOException;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) throws IOException {

		Scanner scan = new Scanner(System.in);
		int a[][] = new int[3][3];
		int n;
		final int select = 500;

		for (int i = 0; i < 3; i++) {
			for (int j = 0; j < 3; j++) {
				a[i][j] = scan.nextInt();
			}
		}

		n = scan.nextInt();

		int inputN[] = new int[n];
		for (int n_count = 0; n_count < n; n++) {
			inputN[n_count] = scan.nextInt();

			for (int i = 0; i < 3; i++) {
				for (int j = 0; j < 3; j++) {

					if (a[i][j] == inputN[n_count]) {
						a[i][j] = select;
					}

				}
			}
		}

		//最後に確認
		//行確認
		//1行目 =
		int first_row = a[0][0] + a[0][1] + a[0][2];
		int secont_row = a[1][0] + a[1][1] + a[1][2];
		int third_row = a[2][0] + a[2][1] + a[2][2];

		//列
		int first_col = a[0][0] + a[1][0] + a[2][0];
		int secont_col = a[0][1] + a[1][1] + a[2][1];
		int third_col = a[0][2] + a[1][2] + a[2][2];
		//斜め1
		int naname1 = a[0][0] + a[1][1] + a[2][2];
		int naname2 = a[0][2] + a[1][1] + a[2][0];

		if (first_row == 1500) {
			System.out.println("Yes");
			return;
		}

		if (secont_row == 1500) {
			System.out.println("Yes");
			return;
		}
		if (third_row == 1500) {
			System.out.println("Yes");
			return;
		}

		if (first_col == 1500) {
			System.out.println("Yes");
			return;
		}
		if (secont_col == 1500) {
			System.out.println("Yes");
			return;
		}
		if (third_col == 1500) {
			System.out.println("Yes");
			return;
		}

		if (naname1 == 1500) {
			System.out.println("Yes");
			return;
		}

		if (naname2 == 1500) {
			System.out.println("Yes");
			return;
		}

		System.out.println("No");

		//ビンゴカード作成
		//		int bingoCard[][] = new int[3][3];
		//		for (int i = 0; i < 3; i++) {
		//			for (int j = 0; j < 3; j++) {
		//				a[i][j] = 0;
		//			}
		//		}

	}

	/**
	 * 余りを求める。
	 * @param a
	 * @param b
	 * @return 余り。余りがマイナスの時はプラスで返す。ｓ
	 */
	public static long myMod(long a, long b) {
		long ret = 0;

		ret = a % b;

		if (ret < 0) {
			ret += b;
		}

		return ret;
	}

	/**
	 * 乗数を求める ※mod対応
	 * @param a 基数
	 * @param n 乗数
	 * @param primeNumMod 法 mod値 使わない場合は「0」
	 * @return
	 */
	public static long myModPow(long a, long n, long primeNumMod) {

		long ans = 1;

		//乗数が0の場合→1
		if (n == 0)
			return 1;

		if (primeNumMod == 0) {
			//modを使わないとき

			while (n > 0) {

				if (n % 2 == 0) {
					//累乗が偶数の時

					a *= a;
					n = n / 2;
				} else {
					//累乗が奇数の時
					ans *= a;
					n--;
				}
			}

			return ans;

		} else {
			//modを使うとき

			//初めに桁を落とす
			a = myMod(a, primeNumMod);

			while (n > 0) {

				if (n % 2 == 0) {
					//累乗が偶数の時

					a *= myMod(a, primeNumMod);
					n = n / 2;

				} else {
					//累乗が奇数の時
					ans *= myMod(a, primeNumMod);
					n--;

				}
			}

			return myMod(ans, primeNumMod);

		}

	}

}