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

use std::collections::HashMap;
use std::io;

fn read_line() -> String {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    input
}

fn main() {
    let mut board: HashMap<usize, (usize, usize)> = HashMap::new();
    let mut marked = vec![vec![false; 3]; 3];

    for i in 0..3 {
        let x: Vec<usize> = read_line()
            .trim()
            .split_whitespace()
            .map(|s| s.parse::<usize>().unwrap())
            .collect();

        for (j, el) in x.iter().enumerate() {
            board.insert(*el, (i, j));
        }
    }

    let ntc = read_line().trim().parse::<usize>().unwrap();
    for _ in 0..ntc {
        let x = read_line().trim().parse::<usize>().unwrap();
        if board.contains_key(&x) {
            let (i, j) = board.get(&x).unwrap();
            marked[*i][*j] = true;
        }
    }

    let any_line = marked
        .iter()
        .any(|x| (x.iter().min() == x.iter().max()) == true);

    // transpose rows into columns
    let columns: Vec<Vec<bool>> = (0..3)
        .map(|row_idx| {
            marked
                .iter()
                .flatten()
                .skip(row_idx)
                .step_by(3)
                .cloned()
                .collect()
        })
        .collect();

    let any_column = columns
        .iter()
        .any(|x| (x.iter().min() == x.iter().max()) == true);

    let first_diag: Vec<bool> = marked.iter().flatten().step_by(4).cloned().collect();
    let second_diag: Vec<bool> = marked.iter().rev().flatten().step_by(4).cloned().collect();

    let diags = vec![first_diag, second_diag];
    let any_diag = diags
        .iter()
        .any(|x| (x.iter().min() == x.iter().max()) == true);

    let verifications = vec![any_column, any_diag, any_line];
    if verifications.iter().any(|x| *x == true) == true {
        println!("Yes");
    } else {
        println!("No");
    }
}