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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using System.Text;

class Program
{
    static void Main(string[] args)
    {
        // 入力
        int[] a1 = Console.ReadLine().Split().Select(int.Parse).ToArray();
        int[] a2 = Console.ReadLine().Split().Select(int.Parse).ToArray();
        int[] a3 = Console.ReadLine().Split().Select(int.Parse).ToArray();
        int n = int.Parse(Console.ReadLine());

        int[] b = new int[n];
        for (int i = 0; i < n; i++)
        {
            b[i] = int.Parse(Console.ReadLine());
        }

        int[] ba1 = Enumerable.Repeat<int>(0, 3).ToArray();
        int[] ba2 = Enumerable.Repeat<int>(0, 3).ToArray();
        int[] ba3 = Enumerable.Repeat<int>(0, 3).ToArray();
        for (int i = 0; i < n; i++)
        {
            int num1 = Array.IndexOf(a1, b[i]);
            if (num1 >= 0)
            {
                ba1[num1] = 1;
            }

            int num2 = Array.IndexOf(a2, b[i]);
            if (num2 >= 0)
            {
                ba2[num2] = 1;
            }

            int num3 = Array.IndexOf(a3, b[i]);
            if (num3 >= 0)
            {
                ba3[num3] = 1;
            }
        }

        int bingo = 0;
        //横検索
        if (ba1[0] == 1 && ba1[1] == 1 && ba1[2] == 1)
        {
            bingo = 1;
        }
        if (ba2[0] == 1 && ba2[1] == 1 && ba2[2] == 1)
        {
            bingo = 1;
        }
        if (ba3[0] == 1 && ba3[1] == 1 && ba3[2] == 1)
        {
            bingo = 1;
        }

        //縦検索
        if (ba1[0] == 1 && ba2[0] == 1 && ba3[0] == 1)
        {
            bingo = 1;
        }
        if (ba1[1] == 1 && ba2[1] == 1 && ba3[1] == 1)
        {
            bingo = 1;
        }
        if (ba1[2] == 1 && ba2[2] == 1 && ba3[2] == 1)
        {
            bingo = 1;
        }

        //ななめ検索
        if (ba1[0] == 1 && ba2[1] == 1 && ba3[2] == 1)
        {
            bingo = 1;
        }
        if (ba1[2] == 1 && ba2[1] == 1 && ba3[0] == 1)
        {
            bingo = 1;
        }


        if (bingo == 1)
        {
             Console.WriteLine("Yes");
        }
        else
        {
            Console.WriteLine("No");
        }
       

    }
}