Score : 200 points
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.
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
If we will have a bingo, print Yes
; otherwise, print No
.
84 97 66 79 89 11 61 59 7 7 89 7 87 79 24 84 30
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.
41 7 46 26 89 2 78 92 8 5 6 45 16 57 17
No
We will mark nothing.
60 88 34 92 41 43 65 73 48 10 60 43 88 11 48 73 65 41 92 34
Yes
We will mark all the squares.