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 Rust (1.15.1) (judge verdict: Accepted)

use std::io;

fn main() {
	//let mut a: Vec<Vec<i32>> = vec![vec![0, 0, 0], vec![0, 0, 0], vec![0, 0, 0]];
	let mut flag = true;
	let mut a: Vec<Vec<i32>> = Vec::new();
	a.push(Vec::new());
	a.push(Vec::new());
	a.push(Vec::new());
	for number in (0..3){
		let mut buf = String::new();
		io::stdin().read_line(&mut buf).expect("error");
		let mut iter = buf.split_whitespace();
		for num in (0..3) {
			a[number].push(match iter.next().unwrap().parse() {
				Ok(n) => n,
				Err(_) => panic!(""),
			}
			);
		}
	}
	
	let mut buf = String::new();
	io::stdin().read_line(&mut buf).expect("error");
	let n: i32 = match buf.trim().parse() {
		Ok(num) => num,
		Err(_) => panic!(""),
	};
	let mut b: Vec<i32> = Vec::new();
	for number in (0..n) {
		let mut buf = String::new();
		io::stdin().read_line(&mut buf).expect("error");
		b.push(
			match buf.trim().parse() {
				Ok(num) => num,
				Err(_) => panic!(""),
			}
		);
	}
	
	
	let mut c: Vec<Vec<bool>> = Vec::new();
	for i in (0..3) {
		c.push(Vec::new());
	}
	for i in (0..3) {
		for j in (0..3) {
			c[i].push(false);
		}
	}
	for i in (0..3) {
		for j in (0..3) {
			for k in &b {
				if a[i][j] == *k {
 					c[i][j] = true;
				}
				if c[i][j] {
					break;
				}
			}
		}
	}
	
	for i in (0..3) {
		if c[i][0] && c[i][1] && c[i][2] {
			flag = false;
		}
	}
	
	if flag {
		for i in (0..3) {
			if c[0][i] && c[1][i] && c[2][i] {
				flag = false;
			}
		}
	}
	
	if flag {
		if c[0][0] && c[1][1] && c[2][2] {
			flag = false;
		}
		if flag && c[0][2] && c[1][1] && c[2][0] {
			flag = false;
		}
	}
	if flag {
		println!("No");
	}else {
		println!("Yes");
	}
}