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++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
//const ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
ll myctoi(char C) {return C - '0';}
char myitoc(ll N) {return '0' + N;}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  vector<vector<ll>> A(3, vector<ll>(3));
  for (ll i = 0; i < 3; i++)
  {
    for (ll j = 0; j < 3; j++)
    {
      cin >> A.at(i).at(j);
    }
  }
  vector<vector<bool>> B(3, vector<bool>(3, false));
  ll N;
  cin >> N;
  for (ll q = 0; q < N; q++)
  {
    ll b;
    cin >> b;
    for (ll i = 0; i < 3; i++)
    {
      for (ll j = 0; j < 3; j++)
      {
        if (A.at(i).at(j) == b)
          B.at(i).at(j) = true;
      }
    }
  }

  for (ll i = 0; i < 3; i++)
  {
    bool ok = true;
    for (ll j = 0; j < 3; j++)
    {
      if (!B.at(i).at(j))
      {
        ok = false;
        break;
      }
    }
    if (ok)
      FINALANS("Yes");

    ok = true;
    for (ll j = 0; j < 3; j++)
    {
      if (!B.at(j).at(i))
      {
        ok = false;
        break;
      }
    }
    if (ok)
      FINALANS("Yes");
  }

  bool ok2 = true;
  for (ll i = 0; i < 3; i++)
  {
    if (!B.at(i).at(i))
    {
      ok2 = false;
      break;
    }
  }
  if (ok2)
    FINALANS("Yes");

  bool ok3 = true;
  for (ll i = 0; i < 3; i++)
  {
    if (!B.at(i).at(2 - i))
    {
      ok3 = false;
      break;
    }
  }
  if (ok3)
    FINALANS("Yes");

  FINALANS("No");
}