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 whiteread::parse_line;

fn is_bingo(check: &Vec<Vec<bool>>, x: usize, y: usize, mode: i32) -> bool {
    if !check[x][y] {
        return false;
    }
    match mode {
        0 => {
            for i in 0..3 {
                let i = i as usize;
                if !check[i][y] {
                    return false;
                }
            }
            true
        }
        1 => {
            for i in 0..3 {
                let i = i as usize;
                if !check[x][i] {
                    return false;
                }
            }
            true
        }
        2 => {
            for i in 0..3 {
                let i = i as usize;
                if !check[i][i] {
                    return false;
                }
            }
            true
        }
        _ => {
            unreachable!();
        }
    }
}

fn bingo(card: &Vec<Vec<i32>>, check: &mut Vec<Vec<bool>>, num: i32) {
    for i in 0..3 {
        let i = i as usize;
        for k in 0..3 {
            let k = k as usize;
            if card[i][k] == num {
                check[i][k] = true;
                //let mut ans = is_bingo(check, i, k, 0) || is_bingo(check, i, k, 1);
                //if i == k {
                //ans = ans || is_bingo(check, i, k, 2);
                //}
                //return ans;
            }
        }
    }
    //false
}

fn main() {
    let mut a: Vec<Vec<i32>> = Vec::with_capacity(3);
    let mut check = vec![vec![false; 3]; 3];
    for _ in 0..3 {
        a.push(parse_line().unwrap());
    }
    let n: usize = parse_line().unwrap();
    /*
    for _ in 0..n {
        if bingo(&a, &mut check, parse_line().unwrap()) {
            println!("Yes");
            return;
        }
    }
    println!("No");
    */

    for _ in 0..n {
        bingo(&a, &mut check, parse_line().unwrap())
    }

    let mut ans = false;
    for i in 0..3 {
        let i = i as usize;
        for k in 0..3 {
            let k = k as usize;
            if ans {
                break;
            }
            ans = is_bingo(&mut check, i, k, 0) || is_bingo(&mut check, i, k, 1);
            if i == k {
                ans = ans || is_bingo(&mut check, i, k, 2);
            }
        }
    }
    if ans {
        println!("Yes");
    } else {
        println!("No");
    }
}