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)

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
using namespace std;
typedef long long ll;
template<class T> using V=vector<T>;
using Graph = vector<vector<int>>;
using P=pair<ll,ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//V,P(大文字)使用不可
//乗算の際にオーバーフローに注意せよ！！（適切にmodをとれ）

const ll INF=1e18;

int a[5][5];

signed main(){
    rep(i,3){
        rep(j,3) cin>>a[i][j];
    }
    int n;
    cin>>n;
    V<int> b(n);
    cinf(n,b);
    int ans=0;
    bool ok=1;
    set<int> st;
    rep(i,n) st.insert(b[i]);
    rep(i,3){
        if(!st.count(a[i][1])) ok=0;
    }
    if(ok) ans++;
    ok=1;
    rep(i,3){
        if(!st.count(a[1][i])) ok=0;
    }
    if(ok) ans++;
    ok=1;
    rep(i,3){
        if(!st.count(a[i][0])) ok=0;
    }
    if(ok) ans++;
    ok=1;
    rep(i,3){
        if(!st.count(a[0][i])) ok=0;
    }
    if(ok) ans++;
    ok=1;
    rep(i,3){
        if(!st.count(a[i][2])) ok=0;
    }
    if(ok) ans++;
    ok=1;
    rep(i,3){
        if(!st.count(a[2][i])) ok=0;
    }
    if(ok) ans++;
    ok=1;
    if(st.count(a[0][0])&&st.count(a[1][1])&&st.count(a[2][2]))ok=1;
    else ok=0;
    if(ok) ans++;
    ok=1;
    if(st.count(a[0][2])&&st.count(a[1][1])&&st.count(a[2][0]))ok=1;
    else ok=0;
    if(ok) ans++;
    ok=1;
    if(ans>0) cout<<"Yes";
    else cout<<"No";
}