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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int diagonal (int check[][3])
{
    if(check[0][0] != 0 && check[1][1] != 0 && check[2][2] != 0)
    {
        return 1;
    }

    return 0;
}

int row (int check[][3])
{
    int i, j, cont = 0;
    for(i = 0; i < 3; i++)
    {
        for(j = 0; j < 3; j++)
        {
            if(check[i][j] != 0)
            {
                cont++;
            }
            else
            {
                break;
            }
        }

        if(cont >= 3)
        {
            return 1;
        }
        
        cont = 0;
    }

    return 0;
}

int column (int check[][3])
{
    int i, j, cont = 0;
    for(i = 0; i < 3; i++)
    {
        for(j = 0; j < 3; j++)
        {
            if(check[j][i] != 0)
            {
                cont++;
            }
            else
            {
                break;
            }
        }

        if(cont >= 3)
        {
            return 1;
        }
        
        cont = 0;
    }

    return 0;
}

int main() {
    int card[3][3], check[3][3], i, j, l, numbers;

    for(i = 0; i < 3; i++)
    {
        for(j = 0; j < 3; j++)
        {
            scanf("%d", &card[i][j]);
            check[i][j] = 0;
        }
    }

    scanf("%d", &numbers);
    int bingo[numbers];

    for(i = 0; i < numbers; i++)
    {
        scanf("%d", &bingo[i]);
    }

    i = 0;
    l = 0;
    while (i < numbers)
    {
        for(l = 0; l < 3; l++)
        {
            for(j = 0; j < 3; j++)
            {
                if(bingo[i] == card[l][j])
                {
                    check[l][j] = card[l][j];
                }
            }
        }

        i++;
    }

    if(diagonal(check) || row(check) || column(check))
    {
        printf("Yes\n");
    }
    else
    {
        printf("No\n");
    }
    
	return 0;
}