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 Common Lisp (SBCL 1.1.14) (judge verdict: Accepted)

(defun split (x str)
  (let (
      (pos (search x str))
      (size (length x)))
    (if pos
      (cons (subseq str 0 pos)
            (split x (subseq str (+ pos size))))
      (list str))))

(defun get-bingo-card ()
  (let ((string-bingo-card (loop 
      as i 
      below 3
      collect (split " " (read-line)))))
    (loop
      as line
      in string-bingo-card
      collect (mapcar #'parse-integer line))))

(defun get-bingo-lines (bingo-card)
  (list
    (nth 0 bingo-card)
    (nth 1 bingo-card)
    (nth 2 bingo-card)
    (map 'list 'first bingo-card)
    (map 'list 'second bingo-card)
    (map 'list 'third bingo-card)
    (loop
      as i
      below 3
      collect (nth i (nth i bingo-card)))
    (loop
      as i
      below 3
      collect (nth (- 2 i) (nth i bingo-card)))
  ))

(defun get-open-numbers ()
  (let (
      (n (read)))
    (loop
      as i
      below n
      collect (read))))

(defun opened-bingo-card (bingo-card numbers)
  (loop
    for line
    in bingo-card
    collect (loop
      for bingo-number
      in line
	    collect (if (position bingo-number numbers) 0 bingo-number))))

(defun exist-bingo-line (lines)
  (if
    (not (zerop 
    (count 
      3
      (loop
        as line
        in lines
        collect (count 0 line)))))
    "Yes"
    "No"))
  

(princ (exist-bingo-line (get-bingo-lines (opened-bingo-card (get-bingo-card) (get-open-numbers)))))