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)

#![allow(unused_imports)]pub mod pcl{pub mod stdin{use std::io::prelude::*;use std::io::stdin;use std::str::FromStr;pub fn read_line()->String{let mut s=String::new();stdin().read_line(&mut s).unwrap();s.trim().to_string()}pub fn read<T:FromStr>()->T{read_from(stdin())}pub fn read_token()->String{read_token_from(stdin())}pub fn read_ascii()->char{read_ascii_from(stdin())}pub fn read_from<R:Read,T:FromStr>(read:R)->T{read_token_from(read).parse().unwrap_or_else(|_|panic!("failed to parse a value"))}pub fn read_token_from<R:Read>(read:R)->String{read.bytes().flat_map(|x|x.map(|x|x as char)).skip_while(|x|x.is_whitespace()).take_while(|x|!x.is_whitespace()).collect()}pub fn read_ascii_from<R:Read>(read:R)->char{read.bytes().flat_map(|x|x.map(|x|x as char)).skip_while(|x|x.is_whitespace()).next().expect("failed to get a next character")}}}
use pcl::stdin::*;
fn main() {
    let mut v = vec![vec![0; 3]; 3];
    for r in &mut v {
        for x in r {
            *x = read();
        }
    }
    let n: usize = read();
    for _ in 0..n {
        let b: i32 = read();
        'check: for r in &mut v {
            for x in r {
                if *x == b {
                    *x = 0;
                    break 'check;
                }
            }
        }
    }
    let bingo = match (
        (v[0][0], v[0][1], v[0][2]),
        (v[1][0], v[1][1], v[1][2]),
        (v[2][0], v[2][1], v[2][2]),
    ) {
        ((0, 0, 0), _, _) | (_, (0, 0, 0), _) | (_, _, (0, 0, 0)) => true,
        _ => false,
    };
    let bingo = bingo
        || match (
            (v[0][0], v[1][0], v[2][0]),
            (v[0][1], v[1][1], v[2][1]),
            (v[0][2], v[1][2], v[2][2]),
        ) {
            ((0, 0, 0), _, _) | (_, (0, 0, 0), _) | (_, _, (0, 0, 0)) => true,
            _ => false,
        };
    let bingo = bingo
        || match ((v[0][0], v[1][1], v[2][2]), (v[2][0], v[1][1], v[0][2])) {
            ((0, 0, 0), _) | (_, (0, 0, 0)) => true,
            _ => false,
        };
    if bingo {
        println!("Yes");
    } else {
        println!("No");
    }
}