#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
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; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, M; cin >> N >> M;
    vector<ll> X(M);
    rep(i,M) cin >> X[i];
    vector<ll> T(N);
    vector C(N, vector<ll>(M));
    rep(i,N){
        rep(j,M) cin >> C[i][j];
        cin >> T[i];
    }

    rep(i,N)if(T[i]==100){
        bool f = true;
        rep(c,M)if(X[c]!=C[i][c])f=false;
        if(f){
            cout << "Yes" << endl;
            return 0;
        }
    }

    set<vector<ll>> st;
    for(int i = 0; i < N; i++){
        bool f = true;
        vector<ll> res(M);
        rep(c,M){
            res[c] = 10000ll * X[c] - 100ll * T[i] * C[i][c];
            if(res[c] < 0) f = false;
            if((100ll - T[i] > 0) && (res[c] % (100ll - T[i]))) f = false;

            if(T[i] == 100ll) res[c] = 0;
            else res[c] /= 100ll - T[i];
        }

        if(f && st.find(res)!=st.end()){
            cout << "Yes" << endl;
            return 0;
        }

        f = true;
        vector<ll> tc(M);
        rep(c,M) {
            tc[c] = T[i] * C[i][c];
            if(tc[c] > 10000ll * X[c]) f = false;
        }
        if(f)st.insert(tc);
    }

    st.clear();
    for(int i = N - 1; i >= 0; i--){
        bool f = true;
        vector<ll> res(M);
        rep(c,M){
            res[c] = 10000ll * X[c] - 100ll * T[i] * C[i][c];
            if(res[c] < 0) f = false;
            if((100ll - T[i] > 0) && (res[c] % (100ll - T[i]))) f = false;

            if(T[i] == 100ll) res[c] = 0;
            else res[c] /= 100ll - T[i];
        }

        if(f && st.find(res)!=st.end()){
            cout << "Yes" << endl;
            return 0;
        }

        f = true;
        vector<ll> tc(M);
        rep(c,M) {
            tc[c] = T[i] * C[i][c];
            if(tc[c] > 10000ll * X[c]) f = false;
        }
        if(f)st.insert(tc);
    }

    cout << "No" << endl;
    return 0;
}