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: Accepted)

module Main where

import Data.List
import Control.Monad
import Debug.Trace
import qualified Data.ByteString.Char8 as BC
import Data.Maybe (fromJust)
import qualified Data.Set  as S


readTuple2 :: IO (Int, Int)
readTuple2 = do
    [a, b] <- map (fst . fromJust . BC.readInt) . BC.words <$> BC.getLine
    return (a, b)

readTuple3 :: IO (Int, Int, Int)
readTuple3 = do
    [a, b, c] <- map (fst . fromJust . BC.readInt) . BC.words <$> BC.getLine
    return (a, b, c)

readInt :: IO Int
readInt = fst . fromJust . BC.readInt <$> BC.getLine

readInts :: IO [Int]
readInts = map (fst . fromJust . BC.readInt) . BC.words <$> BC.getLine

split :: (a -> Bool) -> [a] -> [[a]]
split f [] = []
split f as = let
    (fo, la) = span f as
    las = case la of
        [] -> []
        xs -> split f $ tail xs
    in
        case fo of
            [] -> las
            xs -> xs : las

solve (a1,a2,a3) (b1,b2,b3) (c1,c2,c3) bingos = 
    let
        bingo = S.fromList bingos
    in
    if a1 `S.member` bingo && a2  `S.member` bingo && a3 `S.member` bingo then "Yes"
    else if b1 `S.member` bingo && b2  `S.member` bingo && b3 `S.member` bingo then "Yes"
    else if c1 `S.member` bingo && c2  `S.member` bingo && c3 `S.member` bingo then "Yes"
    else if a1 `S.member` bingo && b1  `S.member` bingo && c1 `S.member` bingo then "Yes"
    else if a2 `S.member` bingo && b2  `S.member` bingo && c2 `S.member` bingo then "Yes"
    else if a3 `S.member` bingo && b3  `S.member` bingo && c3 `S.member` bingo then "Yes"
    else if a1 `S.member` bingo && b2  `S.member` bingo && c3 `S.member` bingo then "Yes"
    else if c1 `S.member` bingo && b2  `S.member` bingo && a3 `S.member` bingo then "Yes"
        else "No"



main = do
    a <- readTuple3
    b <- readTuple3
    c <- readTuple3
    num <- readInt
    bingos <- replicateM num readInt
    putStrLn $ solve a b c bingos