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 Go (1.6) (judge verdict: Wrong Answer)

package main

import (
	"fmt"
)

func main() {

	listA1 := make([]int, 3)
	for i := 0; i < 3; i++ {
		fmt.Scan(&listA1[i])
	}
	listA2 := make([]int, 3)
	for i := 0; i < 3; i++ {
		fmt.Scan(&listA2[i])
	}
	listA3 := make([]int, 3)
	for i := 0; i < 3; i++ {
		fmt.Scan(&listA3[i])
	}
	var n int
	fmt.Scan(&n)
	listB := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Scan(&listB[i])
	}

	var matrix [3][3]int = [3][3]int{
		{listA1[0], listA1[1], listA1[2]},
		{listA2[0], listA2[1], listA2[2]},
		{listA3[0], listA3[1], listA3[2]},
	}

	bingo := false
	for i := 0; i < 3; i++ {
		for j := 0; j < n; j++ {
			if matrix[0][i] == listB[j] {
				bingo = true
			} else {
				bingo = false
				break
			}
		}
		if bingo == false {
			break
		}
	}
	if bingo == true {
		fmt.Println("Yes")
		return
	}
	bingo = false
	for i := 0; i < 3; i++ {
		for j := 0; j < n; j++ {
			if matrix[1][i] == listB[j] {
				bingo = true
			} else {
				bingo = false
				break
			}
		}
		if bingo == false {
			break
		}
	}
	if bingo == true {
		fmt.Println("Yes")
		fmt.Println("ok")
		return
	}

	bingo = false
	for i := 0; i < 3; i++ {
		for j := 0; j < n; j++ {
			if matrix[2][i] == listB[j] {
				bingo = true
			} else {
				bingo = false
				break
			}
		}
		if bingo == false {
			break
		}
	}
	if bingo == true {
		fmt.Println("Yes")
		return
	}
	bingo = false
	for i := 0; i < 3; i++ {
		for j := 0; j < n; j++ {
			if matrix[i][0] == listB[j] {
				bingo = true
			} else {
				bingo = false
				break
			}
		}
		if bingo == false {
			break
		}
	}
	if bingo == true {
		fmt.Println("Yes")
		return
	}
	bingo = false
	for i := 0; i < 3; i++ {
		for j := 0; j < n; j++ {
			if matrix[i][1] == listB[j] {
				bingo = true
			} else {
				bingo = false
				break
			}
		}
		if bingo == false {
			break
		}
	}
	if bingo == true {
		fmt.Println("Yes")
		return
	}
	bingo = false
	for i := 0; i < 3; i++ {
		for j := 0; j < n; j++ {
			if matrix[i][2] == listB[j] {
				bingo = true
			} else {
				bingo = false
				break
			}
		}
		if bingo == false {
			break
		}
	}
	if bingo == true {
		fmt.Println("Yes")
		return
	}
	bingo = false
	for i := 0; i < 3; i++ {
		for j := 0; j < n; j++ {
			if matrix[i][i] == listB[j] {
				bingo = true
				break
			} else {
				bingo = false
			}
		}
		if bingo == false {
			break
		}
	}
	if bingo == true {
		fmt.Println("Yes")
		return
	}
	bingo = false
	for i := 0; i < 3; i++ {
		for j := 0; j < n; j++ {
			if matrix[i][2-i] == listB[j] {
				bingo = true
				break
			} else {
				bingo = false
			}
		}
		if bingo == false {
			break
		}
	}
	if bingo == true {
		fmt.Println("Yes")
		return
	}
	fmt.Println("No")
}