#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
using Modint = atcoder::static_modint<998244353>;
//#include "nachia/vec.hpp"
#include <map>
using namespace std;

void testcase(){
    i64 N, M; cin >> N >> M;
    vector<vector<i64>> C(N, vector<i64>(M));
    vector<i64> T(N);
    vector<i64> X(M); rep(i,M) cin >> X[i];
    rep(i,M) X[i] *= 100;
    rep(i,N){
        rep(j,M) cin >> C[i][j];
        cin >> T[i];
        rep(j,M) C[i][j] *= T[i];
    }
    map<vector<i64>, int> ds;
    rep(i,N){
        ds[C[i]] += 1;
    }
    rep(i,N) if(T[i] == 100){
        bool ok = (C[i] == X);
        if(ok){ cout << "Yes\n"; return; }
    }
    rep(i,N) if(T[i] != 100){
        ds[C[i]] -= 1;
        vector<i64> Q(M);
        bool ok = true;
        rep(j,M){
            Q[j] = X[j] - C[i][j];
            if(Q[j] % (100 - T[i])) ok = false;
            Q[j] /= (100 - T[i]); Q[j] *= 100;
        }
        auto p = ds.find(Q);
        if(ok && p != ds.end() && p->second != 0){ cout << "Yes\n"; return; }
        ds[C[i]] += 1;
    }
    cout << "No\n";
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}