#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;

// chmax, chmin
template <class T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return 1;
  }
  return 0;
}

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail
{
  template <typename T, std::size_t NDIMS>
  struct vector_builder
  {
    using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

    static type make(std::vector<std::size_t> dims, const T &v = {})
    {
      const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
      if (!dims.empty())
        dims.pop_back();
      return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
    }
  };

  template <typename T>
  struct vector_builder<T, 1>
  {
    using type = std::vector<T>;

    static type make(std::vector<std::size_t> dims, const T &v = {})
    {
      return type(dims.empty() ? 0 : dims.back(), v);
    }
  };
} // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T &v, SIZE_T... dims)
{
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T &data, vector<int> &iter)
{
  cout << data << " ";
}
template <typename T>
void dump(const vector<T> &data, vector<int> &iter)
{
  for (auto elem : data)
    dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>> &data, vector<int> &iter)
{
  for (auto elem : iter)
  {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++)
  {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T> &data, int dummy)
{
  for (int i = 0; i < data.size(); i++)
  {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T &data)
{ // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

const string YES = "Yes";
const string NO = "No";

void solve(std::vector<std::vector<long long>> A, long long N, std::vector<long long> b)
{

  int M = 3;
  for (auto &&B : A)
  {
    for (auto &&val : B)
    {
      for (auto cand : b)
      {
        if (val == cand)
          val = -1;
      }
    }
  }
  bool ok = false;
  for (int i = 0; i < 3; i++)
  {
    bool tmp = true;
    for (int j = 0; j < 3; j++)
      if (A[i][j] != -1)
        tmp = false;
    if (tmp)
      ok = true;
  }
  for (int i = 0; i < 3; i++)
  {
    bool tmp = true;
    for (int j = 0; j < 3; j++)
      if (A[j][i] != -1)
        tmp = false;
    if (tmp)
      ok = true;
  }
  if (A[0][0] == -1 && A[1][1] == -1 && A[2][2] == -1)
    ok = true;
  if (A[0][2] == -1 && A[1][1] == -1 && A[2][0] == -1)
    ok = true;

  cout << (ok ? "Yes" : "No") << endl;
}

int main()
{
  cout << setprecision(10);
  std::vector<std::vector<long long>> A(3, std::vector<long long>(3));
  for (int i = 0; i < 3; i++)
  {
    for (int j = 0; j < 3; j++)
    {
      scanf("%lld", &A[i][j]);
    }
  }
  long long N;
  scanf("%lld", &N);
  std::vector<long long> b(N);
  for (int i = 0; i < N; i++)
  {
    scanf("%lld", &b[i]);
  }
  solve(std::move(A), N, std::move(b));
  return 0;
}


Measured memory_bytes: 256