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 Haskell (GHC 7.10.3) (judge verdict: Wrong Answer)

import Control.Monad
import Data.Maybe
import qualified Data.ByteString.Char8 as BS

tuplify2 (x:y:_) = (x,y)
tuplify2 _ = undefined

--Input functions with ByteString
readInt = fst . fromJust . BS.readInteger
readIntTuple = tuplify2 . map readInt . BS.words
readIntList = map readInt . BS.words

getInt = readInt <$> BS.getLine
getIntList = readIntList <$> BS.getLine
getIntNList n = map readIntList <$> replicateM (fromIntegral n) BS.getLine
getIntMatrix = map readIntList . BS.lines <$> BS.getContents
getIntTuple = readIntTuple <$> BS.getLine
getIntNTuples n = map readIntTuple <$> replicateM (fromIntegral n) BS.getLine
getIntTuples = map readIntTuple . BS.lines <$> BS.getContents

main = do
    a <- getIntNList 3
    n <- getInt
    b <- replicateM (fromIntegral n) getInt
    let a1 = foldr (\x acc -> if x `elem` b then acc else False) True (a!!0)
    let a2 = foldr (\x acc -> if x `elem` b then acc else False) True (a!!1)
    let a3 = foldr (\x acc -> if x `elem` b then acc else False) True (a!!2)
    let a3 = foldr (\x acc -> if x `elem` b then acc else False) True ([a!!0!!0, a!!1!!0, a!!2!!0])
    let a4 = foldr (\x acc -> if x `elem` b then acc else False) True ([a!!0!!1, a!!1!!1, a!!2!!1])
    let a5 = foldr (\x acc -> if x `elem` b then acc else False) True ([a!!0!!2, a!!1!!2, a!!2!!2])
    let a6 = foldr (\x acc -> if x `elem` b then acc else False) True ([a!!0!!0, a!!1!!1, a!!2!!2])
    let a7 = foldr (\x acc -> if x `elem` b then acc else False) True ([a!!0!!2, a!!1!!1, a!!2!!0])
    putStrLn $ if a1||a2||a3||a4||a5||a6||a7 then "Yes" else "No"