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::str::FromStr;
use std::fmt::Debug;
use std::cmp;
#[allow(dead_code)]
fn read_as_vec<T>() -> Vec<T>
where T: FromStr, <T as FromStr>::Err : Debug{
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().split_whitespace().map(|c| T::from_str(c).unwrap()).collect()

}

#[allow(dead_code)]
fn read_as_string() -> String{
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().to_string()
}

fn set_mark(a: &mut Vec<Vec<u32>>, b: u32){
    for i in 0..3{
        for j in 0..3{
            if a[i][j] == b{
                a[i][j] = 0;
                return;
            }
        }
    }
}

fn is_bingo(a: &Vec<Vec<u32>>) -> bool{
    if a[0][0] == 0 && a[1][1] == 0 && a[2][2] == 0{
        return true;
    }

    if a[0][2] == 0 && a[1][1] == 0 && a[2][0] == 0{
        return true;
    }

    for i in 0..3{
        let mut bflag = true;
        for j in 0..3{
            if a[i][j] != 0{
                bflag = false;
            }
        }
        if bflag{
            return true;
        }
    }

    for i in 0..3{
        let mut bflag = true;
        for j in 0..3{
            if a[j][i] != 0{
                bflag = false;
            }
        }
        if bflag{
            return true;
        }
    }

    return false;
}

fn main(){
    let mut a: Vec<Vec<u32>> = vec![];

    for _ in 0..3{
        a.push(read_as_vec());
    }

    let n : usize = read_as_vec()[0];


    for _ in 0..n{
        let b: u32 = read_as_vec()[0];
        set_mark(&mut a, b);
    }

    if is_bingo(&a){
        println!("Yes");
    }else{
        println!("No");
    }
}