import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;


void main() {
    auto a = iota(3).map!(i => readln.split.to!(int[])).array;
    int N;
    scan(N);
    auto b = iota(N).map!(i => readln.chomp.to!int).array;
    foreach (bi ; b) {
        foreach (i ; 0 .. 3) {
            foreach (j ; 0 .. 3) {
                if (a[i][j] == bi) {
                    a[i][j] = 0;
                }
            }
        }
    }

    foreach (i ; 0 .. 3) {
        if (a[i].all!"a == 0") {
            writeln("Yes");
            return;
        }
    }
    foreach (j ; 0 .. 3) {
        if (!a[0][j] && !a[1][j] && !a[2][j]) {
            writeln("Yes");
            return;
        }
    }
    if ((!a[0][0] && !a[1][1] && !a[2][2]) || (!a[0][2] && !a[1][1] && !a[2][0])) {
        writeln("Yes");
        return;
    }
    writeln("No");
}




void scan(T...)(ref T args) {
    auto line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x > arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x < arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}



