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::collections::HashMap;
use std::io;

type Board = Vec<Vec<bool>>;
type Layout = HashMap<Ball, (usize, usize)>;
type Balls = Vec<Ball>;
type Ball = i32;

fn init_board() -> Board {
    vec![
        vec![false, false, false],
        vec![false, false, false],
        vec![false, false, false],
    ]
}

fn set_ball(board: &mut Board, layout: &Layout, b: Ball) {
    match layout.get(&b) {
        None => return,
        Some(&(x, y)) => board[x][y] = true,
    }
}

fn any_bingo(board: &Board) -> bool {
    for x in 0..3 {
        if board[x][0] && board[x][1] && board[x][2] {
            return true;
        }
    }
    for y in 0..3 {
        if board[0][y] && board[1][y] && board[2][y] {
            return true;
        }
    }
    if board[0][0] && board[1][1] && board[2][2] {
        return true;
    }
    if board[0][2] && board[1][1] && board[2][0] {
        return true;
    }
    return false;
}

fn solve(layout: &Layout, balls: &Balls) -> bool {
    let mut board = init_board();
    for b in balls {
        set_ball(&mut board, &layout, *b);
    }
    any_bingo(&board)
}

fn main() {
    let mut layout: Layout = HashMap::new();
    for y in 0..3 {
        let mut input = String::new();
        io::stdin().read_line(&mut input).unwrap();
        let mut iter = input.split_whitespace();
        for x in 0..3 {
            let a: i32 = iter.next().unwrap().parse().unwrap();
            layout.insert(a, (x, y));
        }
    }
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let n: usize = input.trim().parse().unwrap();
    let mut balls: Vec<i32> = Vec::with_capacity(n);
    for _ in 0..n {
        let mut input = String::new();
        io::stdin().read_line(&mut input).unwrap();
        let b: i32 = input.trim().parse().unwrap();
        balls.push(b);
    }
    if solve(&layout, &balls) {
        println!("Yes");
    } else {
        println!("No");
    }
}