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.42.0) (judge verdict: Accepted)

#![allow(non_snake_case)]
use proconio::input;
use std::collections::HashMap;

fn is_bingo(is_hole: &Vec<Vec<bool>>) -> bool {
    let col0 = is_hole[0][0] && is_hole[1][0] && is_hole[2][0];
    let col1 = is_hole[0][1] && is_hole[1][1] && is_hole[2][1];
    let col2 = is_hole[0][2] && is_hole[1][2] && is_hole[2][2];

    let row0 = is_hole[0][0] && is_hole[0][1] && is_hole[0][2];
    let row1 = is_hole[1][0] && is_hole[1][1] && is_hole[1][2];
    let row2 = is_hole[2][0] && is_hole[2][1] && is_hole[2][2];

    let x0 = is_hole[0][0] && is_hole[1][1] && is_hole[2][2];
    let x1 = is_hole[0][2] && is_hole[1][1] && is_hole[2][0];

    return [col0, col1, col2, row0, row1, row2, x0, x1].iter().any(
        |&b| b,
    );
}

fn main() {
    input! {
        As: [[i64; 3]; 3],
        N: usize,
        Bs: [i64; N],
    }

    let mut is_hole: Vec<Vec<bool>> = vec![vec![false; 3]; 3];
    let mut num_to_ind: HashMap<i64, (usize, usize)> = HashMap::new();

    for (i, lst) in As.iter().enumerate() {
        for (j, &a) in lst.iter().enumerate() {
            let tpl: (usize, usize) = (i, j);
            num_to_ind.insert(a, tpl);
        }
    }

    for b in Bs.iter() {
        if num_to_ind.contains_key(&b) {
            let (i, j): (usize, usize) = *num_to_ind.get(&b).unwrap();
            is_hole[i][j] = true;
        }
    }

    let ans = if is_bingo(&is_hole) { "Yes" } else { "No" };
    println!("{}", ans);
}