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 Kotlin (1.0.0) (judge verdict: Wrong Answer)

fun main(args: Array<String>) {
    // Your code here!
    var bingo1h:MutableMap<Int,Boolean> = mutableMapOf()
    var bingo2h:MutableMap<Int,Boolean> = mutableMapOf()
    var bingo3h:MutableMap<Int,Boolean> = mutableMapOf()
    var numList:MutableList<Int> = mutableListOf()
    var checkList:MutableList<Boolean> = mutableListOf()
    var msg = "No"
    
    get(bingo1h)
    get(bingo2h)
    get(bingo3h)
    
    var n = readLine()!!.toInt()
    
    for(i in 0..n-1){
        numList.add(readLine()!!.toInt())
    }
    
    for(i in 0..0){
        var num = numList[i]
        if(bingo1h.containsKey(num)){ bingo1h.set(num,true)}
        if(bingo2h.containsKey(num)){ bingo2h.set(num,true)}
        if(bingo3h.containsKey(num)){ bingo3h.set(num,true)}
    }
    
    for(i in 0..2){
        checkList.add(check("v",bingo1h.values.toList(),bingo2h.values.toList(),bingo3h.values.toList()))
        checkList.add(check("h",bingo1h.values.toList(),bingo2h.values.toList(),bingo3h.values.toList()))
        checkList.add(check("s",bingo1h.values.toList(),bingo2h.values.toList(),bingo3h.values.toList()))
    }
    
    var cnt = checkList.filter{it}.count() 
    if(cnt > 0){msg = "Yes"}
    print(msg)
}

//横判定、縦判定、斜め判定
fun check(str:String,ivList1:List<Boolean>,ivList2:List<Boolean>,ivList3:List<Boolean>):Boolean{
    var chk = false
    
    if(str == "h"){
        if(ivList1[0] && ivList1[1] && ivList1[2]){
            chk = true
            return chk
        }
        if(ivList2[0] && ivList2[1] && ivList2[2]){
            chk = true
            return chk
        }
        if(ivList3[0] && ivList3[1] && ivList3[2]){
            chk = true
            return chk
        }
    }else if(str == "v"){
        if(ivList1[0] && ivList2[0] && ivList3[0]){
            chk = true
            return chk
        }
        if(ivList1[1] && ivList2[1] && ivList3[1]){
            chk = true
            return chk
        }
        if(ivList1[2] && ivList2[2] && ivList3[2]){
            chk = true
            return chk
        }
        
    }else{
        if(ivList1[0] && ivList2[1] && ivList3[2]){
            chk = true
            return chk
        }
        if(ivList1[2] && ivList2[1] && ivList3[1]){
            chk = true
            return chk
        }

    }
    return chk
}

// ビンゴ取得
fun get(imap:MutableMap<Int,Boolean>){
    var line = readLine()!!.split(" ").map{it.toInt()}
    for(i in 0..2){
        imap.put(line[i],false)
    }
}