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.Collections.Generic;
using System.Linq;
using System.Text;
class Program
{
    static void Main(string[] args)
    {
            // 入力
            List<List<int>> lstBng = new List<List<int>>();
            string[] sS;
            for (int i = 0; i < 3; i++)
            {
                sS = System.Console.ReadLine().Trim().Split(' ');
                List<int> lstRow = new List<int>();
                for (int j = 0; j < sS.Length; j++)
                {
                    lstRow.Add(int.Parse(sS[j]));
                }
                lstRow.Add(0);                                                              // 判別用フラグ(合致カウント)
                lstBng.Add(lstRow);                                                         // Bingo 横
            }
            string s2 = System.Console.ReadLine().Trim();
            int iN = int.Parse(s2);
            List<int> lstCal = new List<int>();
            for (int i = 0; i < iN; i++)
            {
                lstCal.Add(int.Parse(System.Console.ReadLine().Trim()));
            }

            System.Diagnostics.Stopwatch sw = new System.Diagnostics.Stopwatch();
            sw.Start();

            // 解析
            lstBng.Add(new List<int>() { lstBng[0][0], lstBng[1][0], lstBng[2][0], 0 });    // Bingo縦
            lstBng.Add(new List<int>() { lstBng[0][1], lstBng[1][1], lstBng[2][1], 0 });    // Bingo縦
            lstBng.Add(new List<int>() { lstBng[0][2], lstBng[1][2], lstBng[2][2], 0 });    // Bingo縦
            lstBng.Add(new List<int>() { lstBng[0][0], lstBng[1][1], lstBng[2][2], 0 });    // Bingo斜
            lstBng.Add(new List<int>() { lstBng[0][2], lstBng[1][1], lstBng[0][2], 0 });    // Bingo斜
            for (int k = 0; k < lstCal.Count; k++)
            {
                for (int i = 0; i < lstBng.Count; i++)
                {
                    for (int j = 0; j < 3; j++)
                    {
                        if (lstBng[i][j] == lstCal[k]) { lstBng[i][3] += 1; }               // ヒットしたらその行/列/斜の合致カウント+1
                    }
                }
            }
            string sOut = "No";
            for (int i = 0; i < lstBng.Count; i++)
            {
                if (lstBng[i][3] >= 3) { sOut = "Yes"; break; }                             // 合致カウント3以上の行/列/斜はビンゴ
            }

            // 出力
            System.Console.WriteLine("{0}", sOut.ToString().Trim());

            sw.Stop();
#if DEBUG
            Console.WriteLine();
            Console.WriteLine("{0}", sw.Elapsed.ToString());
            Console.WriteLine("続行するには何かキーを押してください．．．");
            Console.ReadKey();
#endif
    }

}