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;

namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {
            input_iter = LazyLoadAllLines();
            //------------------------------------------------//
            //var n = Read<long>();
            //var s = Read();
            //var als = Read<long>(n);
            //var sls = Read(n);
            /*List<Tuple<string, long>> scls = new List<Tuple<string, long>>();
            for (int i = 0; i < m; ++i)
            {
                scls.Add(new Tuple(Read(), Read<long>()));
            }*/
            //List<List<long>> abls = new List<List<long>>();
            //List<long> cls = new List<long>();
            /*List<long> edgeNum = Enumerable.Repeat(0L, (int)n).ToList();
            for (int i = 0; i < n - 1; ++i)
            {
                abls.Add(Read<long>(2));
                abls[i].Add(i);
                abls[i].Add(-1);
                --abls[i][0];
                --abls[i][1];
                //cls.Add(Read<long>());
                ++edgeNum[(int)abls[i][0]];
                ++edgeNum[(int)abls[i][1]];
            }*/

            //als.Sort((l, r) => (r - l));
            //sls.Sort(StringComparer.OrdinalIgnoreCase);


            List<List<long>> als = new List<List<long>>();
            als.Add(Read<long>(3));
            als.Add(Read<long>(3));
            als.Add(Read<long>(3));
            var n = Read<long>();
            var bls = Read<long>(n);

            List<List<Tuple<int, int>>> lines = new List<List<Tuple<int, int>>>();
            lines.Add(new List<Tuple<int, int>> { Tuple.Create(0, 0), Tuple.Create(0, 1), Tuple.Create(0, 2) });
            lines.Add(new List<Tuple<int, int>> { Tuple.Create(1, 0), Tuple.Create(1, 1), Tuple.Create(1, 2) });
            lines.Add(new List<Tuple<int, int>> { Tuple.Create(2, 0), Tuple.Create(2, 1), Tuple.Create(2, 2) });
            lines.Add(new List<Tuple<int, int>> { Tuple.Create(0, 0), Tuple.Create(1, 0), Tuple.Create(2, 0) });
            lines.Add(new List<Tuple<int, int>> { Tuple.Create(0, 1), Tuple.Create(1, 1), Tuple.Create(2, 1) });
            lines.Add(new List<Tuple<int, int>> { Tuple.Create(0, 2), Tuple.Create(1, 2), Tuple.Create(2, 2) });
            lines.Add(new List<Tuple<int, int>> { Tuple.Create(0, 0), Tuple.Create(1, 1), Tuple.Create(2, 2) });
            lines.Add(new List<Tuple<int, int>> { Tuple.Create(0, 2), Tuple.Create(1, 1), Tuple.Create(2, 0) });

            var aals = als.Select(line => line.Select(num => bls.Contains(num)).ToList()).ToList();

            for(int i = 0; i < lines.Count; ++i)
            {
                var line = lines[i];
                if(aals[line[0].Item1][line[0].Item2] & aals[line[1].Item1][line[1].Item2] && aals[line[2].Item1][line[2].Item2])
                {
                    Console.WriteLine("Yes");
                    return;
                }
            }

            Console.WriteLine("No");
        }

        static IEnumerator<string> input_iter;

        static IEnumerator<string> LazyLoadAllLines(bool doSplit = true)
        {
            string line;
            if (doSplit)
            {
                do
                {
                    line = Console.ReadLine();
                    foreach (var s in line.Split(' '))
                        yield return s;
                } while (line != null);
            }
            else
            {
                do
                {
                    line = Console.ReadLine();
                    yield return line;
                } while (line != null);
            }
        }
        static _T Read<_T>() where _T : struct
        {
            input_iter.MoveNext();
            return (_T)Convert.ChangeType(input_iter.Current, typeof(_T));
        }
        static string Read()
        {
            input_iter.MoveNext();
            return input_iter.Current;
        }
        static List<_T> Read<_T>(long num) where _T : struct
        {
            List<_T> res = new List<_T>();
            for (long i = 0; i < num; ++i)
            {
                input_iter.MoveNext();
                res.Add((_T)Convert.ChangeType(input_iter.Current, typeof(_T)));
            }
            return res;
        }
        static List<string> Read(long num)
        {
            List<string> res = new List<string>();
            for (long i = 0; i < num; ++i)
            {
                input_iter.MoveNext();
                res.Add(input_iter.Current);
            }
            return res;
        }

    }
}