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.util.*;

public class Main{
	public static void main( String[] args ){
		
		//Make a instance of Scanner
		Scanner scan = new Scanner(System.in);
		
		//size of matrix
		int size = 3;
		int matrix[][] = new int[size][size];
		
		// input each values in the matrix
		for(int i = 0; i < matrix.length ; i++){
			for(int j = 0 ; j < matrix[i].length ; j++ ){
				matrix[i][j] = scan.nextInt();
			}
		}
		
		// input numbers to be inspected
		int n = scan.nextInt();
		int num[] = new int[n];
		for(int i = 0; i< num.length ; i++){
			num[i] = scan.nextInt();
		}
		
		// second matrix to show if each elements in matrix[][] matchs any elements in num[]
		boolean isCoincide[][] = new boolean[size][size];
		
		// initialize all isCoincide[][] elements with 'true'
		for(int i = 0 ; i< matrix.length ; i++){
			for(int j = 0 ; j < matrix[i].length ; j++){
				for(int k = 0 ; k < num.length ; k++){
					if(matrix[i][j] == num[k]){
						isCoincide[i][j] = true;
					}
				}
			}
		}
		
		
		// isBingo[0] shows if each row is judged as bingo
		// isBingo[1] shows if each line is judged as bingo
		// isBingo[2][0] shows diagonal line (top-left to bottom-right) is judged as bingo
		// isBingo[2][1] shows diagonal line (top-right to bottom-left) is judged as bingo
		boolean isBingo[][] = new boolean[3][];
		
		// set elements by initializing isBingo[][]
		isBingo[0] = new boolean[] {true,true,true};
		isBingo[1] = new boolean[] {true,true,true};
		isBingo[2] = new boolean[] {true,true};
		
		
		// inspect all elements in isCoincide[][] and judge bingo
		for(int i = 0 ; i < matrix.length ; i++){
			for(int j = 0 ; j < matrix[i].length ; j++){
				
				// for this 'if' statement, i means line , and j means row
				if(isCoincide[i][j] != true){
					isBingo[0][j] = false;
					isBingo[1][i] = false;
					if(i == j){
						isBingo[2][0] = false;
					}
					if(2-i == j){
						isBingo[2][1] = false;
					}
				}
			}
		}
		
		// boolean variable showing there is a bingo in matrix[][]
		boolean bingo = false;
		
		for(int i = 0 ; i < isBingo.length ; i++){
			for(int j = 0 ; j < isBingo[i].length ; j++){
				if(isBingo[i][j] == true){
					bingo = true;
				}
			}
		}
		
		if(bingo){
			System.out.println("Yes");
		}else{
			System.out.println("No");
		}
	}
}