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 JavaScript (node.js v5.12) (judge verdict: Accepted)

var input = require("fs").readFileSync("/dev/stdin", "utf8").trim().split("\n");
var obj = {
  "list" : input,
  "index" : 0,
  "max" : input.length,
  "next" : function(){
    if(!this.hasNext()){throw "NoSuchElementException:次に要素は無いよ";}
    var returnObj = this.list[this.index];
    this.index++;
    return returnObj;
  },
  "hasNext" : function(){return (this.index < this.max);}
}
Main();
function next(){return obj.next();}
function hasNext(){return obj.hasNext();}
function myout(t){console.log(t);}//standard output
function myerr(t){console.error(t);}//standard error
//[no]要素の扱い。数値型
//不明値、異常時:引数そのまま返す　1:数値へ変換
//2:半角SPで分割 4:半角SPで分割し、数値配列へ
//6:1文字で分割  7:1文字で分割し、数値配列へ
//8:半角SPで結合 9:改行で結合 0:文字なしで結合
function myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(" ");case 4:return i.split(" ").map((a)=>Number(a));case 6:return i.split("");case 7:return i.split("").map((a)=>Number(a));case 8:return i.join(" ");case 9:return i.join("\n");case 0:return i.join("");default:return i;}}catch(e){return i;}}
function Main(){
  var list = new Array(3);
  list[0] = myconv(next(),4);
  list[1] = myconv(next(),4);
  list[2] = myconv(next(),4);
  var N = myconv(next(),1);
  for(var i = 0; i < N; i++){
    var tmp = myconv(next(),1);
    for(var j = 0; j < 3; j++){
      for(var k = 0; k < 3; k++){
        if(list[j][k] == tmp){
           list[j][k] = 0;
        }
      }
    }
  }
  if(list[0][0] == 0 && list[0][1] == 0 && list[0][2] == 0){
     myout("Yes");
    return;
  }
  if(list[1][0] == 0 && list[1][1] == 0 && list[1][2] == 0){
     myout("Yes");
    return;
  }
  if(list[2][0] == 0 && list[2][1] == 0 && list[2][2] == 0){
     myout("Yes");
    return;
  }
  if(list[0][0] == 0 && list[1][0] == 0 && list[2][0] == 0){
     myout("Yes");
    return;
  }
  if(list[0][1] == 0 && list[1][1] == 0 && list[2][1] == 0){
     myout("Yes");
    return;
  }
  if(list[0][2] == 0 && list[1][2] == 0 && list[2][2] == 0){
     myout("Yes");
    return;
  }
  if(list[0][0] == 0 && list[1][1] == 0 && list[2][2] == 0){
     myout("Yes");
    return;
  }
  if(list[0][2] == 0 && list[1][1] == 0 && list[2][0] == 0){
     myout("Yes");
    return;
  }
  myout("No");
}