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;

#define each(i, c) for (auto& i : c)
#define mkp(a, b) make_pair(a, b)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9+7;

template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ": " << p.second << ")"; return os; }
template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; each (i, v) os << i << ", "; os << ")"; return os; }
template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; each (i, m) os << i << ", "; os << "}"; return os; }

int main() {
  vector<vector<ll>> a(3, vector<ll>(3, 0));
  for (ll i = 0; i < 3; ++i) {
    for (ll j = 0; j < 3; ++j) {
      cin >> a[i][j];
    }
  }

  ll n;
  cin >> n;

  vector<ll> b(n);
  for (ll i = 0; i < n; ++i) {
    cin >> b[i];
  }

  for (ll i = 0; i < 3; ++i) {
    for (ll j = 0; j < 3; ++j) {
      for (ll k = 0; k < n; ++k) {
        if (a[i][j] == b[k]) {
          a[i][j] = 200;
        }
      }
    }
  }

  bool bingo = false;
  for (ll i = 0; i < 3; ++i) {
    if (a[i][0] == 200 && a[i][1] == 200 && a[i][2] == 200) {
      bingo = true;
    }
  }
  for (ll i = 0; i < 3; ++i) {
    if (a[0][i] == 200 && a[1][i] == 200 && a[2][i] == 200) {
      bingo = true;
    }
  }
  if (a[0][0] == 200 && a[1][1] == 200 && a[2][2] == 200) {
      bingo = true;
  }
  if (a[0][2] == 200 && a[1][1] == 200 && a[2][0] == 200) {
      bingo = true;
  }

  if (bingo) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }

  return 0;
}