#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n, m;
    cin >> n >> m;
    vector<ll> x(m);
    rep(i,m) cin >> x[i];
    map<vector<ll>, ll> st;
    vector<vector<ll>> c(n, vector<ll>(m));
    vector<ll> t(n);
    rep(i,n){
        rep(j,m) cin >> c[i][j];
        cin >> t[i];
        vector<ll> tmp;
        rep(j,m) {
            tmp.push_back(c[i][j]*t[i]);
        }
        st[tmp]++;
    }
    rep(i,n){
        if(t[i]==100) {
            bool ok = true;
            rep(j,m) {
                if(100*x[j]!=t[i]*c[i][j]) ok = false;
            } 
            if(ok) {
                cout<<"Yes"<<endl;
                return 0;
            }
            continue;
        }
        vector<ll> tmp;
        bool ok = true;
        rep(j,m) {
            ll v = 100*100*x[j]-100*t[i]*c[i][j];
            if(v%(100-t[i])) {
                ok = false;
                break;
            }
            tmp.push_back(v/(100-t[i]));
        }
        vector<ll> ts;
        rep(j,m) {
            ts.push_back(c[i][j]*t[i]);
        }
        dbg(ts,tmp);
        if(ok){
            if(tmp==ts && st[tmp]>=2){
                cout<<"Yes"<<endl;
                return 0;
            }
            else if(tmp!=ts && st[tmp]>=1){
                cout<<"Yes"<<endl;
                return 0;
            }
        }
    }
    cout<<"No"<<endl;
    return 0;
}