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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
If I'm the sun, you're the moon
Because when I go up, you go down
*******************************
I'm working for the day I will surpass you
https://www.a2oj.com/Ladder16.html
*/
import java.util.*;
import java.io.*;
import java.math.*;

   public class Main
   {
      public static void main(String omkar[]) throws Exception
      {
         BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));  
         StringTokenizer st = null;
         int[][] grid = new int[3][3];
         for(int i=0; i < 3; i++)
            grid[i] = readArr(3, infile, st);
         int N = Integer.parseInt(infile.readLine());
         HashSet<Integer> set = new HashSet<Integer>();
         while(N-->0)
            set.add(Integer.parseInt(infile.readLine()));
         boolean[][] marked = new boolean[3][3];
         for(int r=0; r < 3; r++)
            for(int c=0; c < 3; c++)
               if(set.contains(grid[r][c]))
                  marked[r][c] = true;
         String res = "No";
         for(int r=0; r < 3; r++)
         {
            int cnt = 0;
            for(boolean b: marked[r])
               if(b)
                  cnt++;
            if(cnt==3)
               res = "Yes";
         }
         for(int c=0; c < 3; c++)
         {
            int cnt = 0;
            for(int r=0; r < 3; r++)   
               if(marked[r][c])
                  cnt++;
            if(cnt==3)
               res = "Yes";
         }
         if(marked[0][0]&&marked[1][1]&&marked[2][2])
            res = "Yes";
         if(marked[2][0]&&marked[1][1]&&marked[0][2])
            res = "Yes";
         System.out.println(res);
      }
      public static int[] readArr(int N, BufferedReader infile, StringTokenizer st) throws Exception
      {
         int[] arr = new int[N];
         st = new StringTokenizer(infile.readLine());
         for(int i=0; i < N; i++)
            arr[i] = Integer.parseInt(st.nextToken());
         return arr;
      }
   }