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: Accepted)

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



int main(){
  int a1[10];
  int a2[10];
  int a3[10];
  int p = 0, q = 0, r = 0;
  int j = 0, k = 0, l = 0;
  int x = 0, y = 0, z = 0;

  scanf("%d %d %d", &a1[0], &a1[1], &a1[2]);
  scanf("%d %d %d", &a2[0], &a2[1], &a2[2]);
  scanf("%d %d %d", &a3[0], &a3[1], &a3[2]);


  int n;
  scanf("%d", &n);

  for(int i = 1; i<=n; i++){
    int b;

    scanf("%d", &b);
    
    if(a1[0] == b || a1[1] == b || a1[2] == b){
      p++;
    }
    if(a2[0] == b || a2[1] == b || a2[2] == b){
      q++;
    }
    if(a3[0] == b || a3[1] == b || a3[2] == b){
      r++;
    }
    if(a1[0] == b || a2[0] == b || a3[0] == b){
      j++;
    }
    if(a1[1] == b || a2[1] == b || a3[1] == b){
      k++;
    }
    if(a1[2] == b || a2[2] == b || a3[2] == b){
      l++;
    }
    if(a1[0] == b || a2[1] == b || a3[2] == b){
      x++;
    }
    if(a1[2] == b || a2[1] == b || a3[0] == b){
      y++;
    }

  }

  //printf("%d %d %d %d %d %d %d %d\n", p, q, r, j, k ,l, x, y);


  if(p == 3 || q == 3 || r == 3 || j == 3 || k==3 || l == 3 || x == 3 || y == 3){
    printf("Yes\n");
  }else{
    printf("No\n");
  }
}