#include using namespace std; int main(){ int N, M; cin >> N >> M; vector X(M); for (int i = 0; i < M; i++){ cin >> X[i]; } vector> C(N, vector(M)); vector T(N); for (int i = 0; i < N; i++){ for (int j = 0; j < M; j++){ cin >> C[i][j]; } cin >> T[i]; } vector, int>> P(N); for (int i = 0; i < N; i++){ P[i].first.resize(M); for (int j = 0; j < M; j++){ P[i].first[j] = T[i] * C[i][j]; } P[i].second = i; } sort(P.begin(), P.end()); bool ok = false; for (int i = 0; i < N; i++){ if (T[i] == 100){ if (X == C[i]){ ok = true; } } else { vector R(M); bool ok2 = true; for (int j = 0; j < M; j++){ R[j] = 10000 * X[j] - 100 * T[i] * C[i][j]; if (R[j] % (100 - T[i]) != 0){ ok2 = false; } R[j] /= 100 - T[i]; } if (ok2){ int p = lower_bound(P.begin(), P.end(), make_pair(R, -1)) - P.begin(); if (p < N){ if (P[p].first == R){ if (P[p].second != i){ ok = true; } else if (p < N - 1){ if (P[p + 1].first == R){ ok = true; } } } } } } } if (ok){ cout << "Yes" << endl; } else { cout << "No" << endl; } }