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 Ruby (2.3.3) (judge verdict: Accepted)

require 'pp'

def gets; ARGF.gets; end

class Solver

  def initialize
  end

  def main
    grid = []
    3.times do |r|
      grid << gets.split.map(&:to_i)
    end

    n = gets.to_i
    n.times do |i|
      b = gets.to_i
      make_hole(grid, b)
    end
    # print(grid)

    if validate_horizontal(grid) || validate_vertical(grid) || validate_naname(grid)
      puts "Yes"
    else
      puts "No"
    end
  end

  def make_hole(g, x)
    g.each do |r|
      0.upto(2) do |i|
        if r[i] == x
          r[i] = 0
        end
      end
    end
  end

  def validate_horizontal(g)
    # 横
    g.each do |r|
      if r[0] == 0 && r[1] == 0 && r[2] == 0
        return true
      end
    end
    false
  end
  def validate_vertical(g)
    0.upto(2) do |col|
      if g[0][col] == 0 && g[1][col] == 0 && g[2][col] == 0
        return true
      end
    end
    false
  end
  def validate_naname(g)
    if g[0][0] == 0 && g[1][1] == 0 && g[2][2] == 0
      return true
    end
    if g[0][2] == 0 && g[1][1] == 0 && g[2][0] == 0
      return true
    end
    false
  end

  def print(grid)
    grid.each do |row|
      puts row.join(",")
    end
  end
end

if __FILE__ == $0
  Solver.new.main
end