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;
using System.Threading.Tasks;

namespace AtCoders {
	class Program {
		static void Main(string[] args) {
var row1 = retreiveIntArray();
			var row2 = retreiveIntArray();
			var row3 = retreiveIntArray();

			var inputCount = 3;

			// 不正な入力は処理しない
			if (row1.Length != inputCount) {
				Console.WriteLine("invalid input");
				return;
			}
			if (row2.Length != inputCount) {
				Console.WriteLine("invalid input");
				return;
			}
			if (row3.Length != inputCount) {
				Console.WriteLine("invalid input");
				return;
			}


			//列の正解を作る
			var col1 = new int[] { row1[0], row2[0], row3[0] };
			var col2 = new int[] { row1[1], row2[1], row3[1] };
			var col3 = new int[] { row1[2], row2[2], row3[2] };

			//斜めの正解を作る
			var diagonal1= new int[] { row1[0], row2[1], row3[2] };
			var diagonal2 = new int[] { row1[2], row2[1], row3[0] };


			var inputNums = retreiveInputNums();

			//ビンゴになる正解のあつまり
			int[][] bingos = { row1, row2,row3, col1, col2, col3, diagonal1, diagonal2 };

			var result = checkBingo(bingos, inputNums);

			//答えの出力
			var ans = result ? "Yes" : "No";
			Console.WriteLine(ans);

		}

		private static bool checkBingo(int[][] bingos,int[] inputnums) {

			foreach (var bingo in bingos) {
				var result = bingo.Select(n => inputnums.Contains(n)).All(t => t);
				//ビンゴになった時点で処理を止める
				if (result) {
					return true;
				}
			}

			return false;
		}


		/// <summary>
		/// 順番に与えられる数値を配列に格納する
		/// </summary>
		/// <returns></returns>
		private static int[] retreiveInputNums() {
			var N = int.Parse(Console.ReadLine());
			var inputNums = new int[N];
			for (int i = 0; i < N; i++) {
				inputNums[i] = int.Parse(Console.ReadLine());
			}

			return inputNums;
		} 

		/// <summary>
		/// スペースで区切られた文字列配列の入力を受け取る
		/// </summary>
		/// <returns></returns>
		private static string[] retreiveStringArray() {
			var inputArray =  Console.ReadLine().Split(' ');
			return inputArray;
		}

		/// <summary>
		/// スペースで区切られた整数配列の入力を受け取る
		/// </summary>
		/// <returns></returns>
		private static int[] retreiveIntArray() {
			var inputArray = Console.ReadLine().Split(' ');
			var intArray = inputArray.Select(s => int.Parse(s));
			return intArray.ToArray();
		}
	}
}