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 <stdlib.h>

int main(void)
{
  int **pBingo = (int **) malloc(sizeof(int *) * 3);
  for (int i = 0; i < 3; i++)
  {
    pBingo[i] = (int *) malloc(sizeof(int) * 3);
  }

  int **pBingoMat = (int **) malloc(sizeof(int *) * 3);
  for (int i = 0; i < 3; i++)
  {
    pBingoMat[i] = (int *) malloc(sizeof(int) * 3);
  }


  for (int i = 0; i < 3; i++)
  {
    char *pRow = (char *) malloc(sizeof(char) * 20);
    fgets(pRow, sizeof(pRow), stdin);

    int pos = 0;
    for (int j = 0; j < 3; j++)
    {
      int val = 0;
      while ('0' <= pRow[pos] && pRow[pos] <= '9') // ' ' != pRow[pos] && '\n' != 
      {
        val = val * 10 + pRow[pos] - '0';
        pos ++;
      }
      pBingo[i][j] = val;
      pos ++;
    }
    // printf("%d, %d, %d", pBingo[i][0], pBingo[i][1], pBingo[i][2]);
    free(pRow);
  }

  // printf("Input N");
  char pN[2];
  fgets(pN, sizeof(pN), stdin);

  int N = 0;
  {
    int pos = 0;
    while ('0' <= pN[pos] && pN[pos] <= '9')
    {
      N = N * 10 + pN[pos] - '0';
      pos ++;
    }
  }

  int *pB = (int *) malloc(sizeof(int) * N);
  {
    int pos = 0;
    char buf[3];
    for (int i = 0; i < N; i++)
    {
      fgets(buf, sizeof(buf), stdin);

      int val = 0;
      pos = 0;
      while('0' <= buf[pos] && buf[pos] <= '9')
      {
        val = val * 10 + buf[pos] - '0';
        pos++;
      }
      pB[i] = val;
      // printf("%d\n", pB[i]);

      for (int i = 0; i < 3; i++)
      {
        for (int j = 0; j < 3; j++)
        {
          pBingoMat[i][j] = pBingoMat[i][j] || (pBingo[i][j] == val) ? 1 : 0;
        } 
      }
    }
  }

  for (int i = 0; i < 3; i++)
  {
    int sum = 0;
    for (int j = 0; j < 3; j++)
    {
      sum += pBingoMat[i][j];
    }
    if (3 == sum)
    {
      printf("Yes");
      return 0;
    }
  }

  for (int i = 0; i < 3; i++)
  {
    int sum = 0;
    for (int j = 0; j < 3; j++)
    {
      sum += pBingoMat[j][i];
    }
    if (3 == sum)
    {
      printf("Yes");
      return 0;
    }
  }

  {
    int sum = 0;
    for (int j = 0; j < 3; j++)
    {
      sum += pBingoMat[j][j];
    }
    if (3 == sum)
    {
      printf("Yes");
      return 0;
    }
  }

  {
    int sum = 0;
    for (int j = 0; j < 3; j++)
    {
      sum += pBingoMat[2-j][2-j];
    }
    if (3 == sum)
    {
      printf("Yes");
      return 0;
    }
  }

  printf("No");
  return 0;
}