#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector<int> x(m);
  for (int& x_i : x) {
    cin >> x_i;
    x_i *= 10000;
  }
  vector c(n, vector(m, 0));
  vector<int> t(n);
  set<vector<int>> st;
  REP(i, n) {
    for (int& c_ij : c[i]) cin >> c_ij;
    cin >> t[i];
    vector<int> tmp = c[i];
    REP(j, m) tmp[j] *= t[i];
    st.emplace(tmp);
  }
  REP(i, n) {
    if (t[i] == 100) {
      bool is_same = true;
      REP(j, m) {
        if (x[j] != 100 * t[i] * c[i][j]) {
          is_same = false;
          break;
        }
      }
      if (is_same) {
        cout << "Yes\n";
        return 0;
      }
    } else {
      bool is_valid = true;
      vector<int> y = x;
      REP(j, m) {
        y[j] -= 100 * t[i] * c[i][j];
        if (y[j] < 0 || y[j] % (100 - t[i]) > 0) {
          is_valid = false;
          break;
        }
        y[j] /= 100 - t[i];
      }
      if (is_valid && st.contains(y)) {
        cout << "Yes\n";
        return 0;
      }
    }
  }
  cout << "No\n";
  return 0;
}