#include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;

template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;

#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)

constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
// constexpr long long MOD = (ll)1e9 + 7;
constexpr long long MOD = 998244353LL;
static const ld pi = 3.141592653589793L;

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

template <class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

struct Edge {
    int to, rev;
    ll cap;
    Edge(int _to, int _rev, ll _cap) : to(_to), rev(_rev), cap(_cap) {}
};

typedef vector<Edge> Edges;
typedef vector<Edges> Graph;

void add_edge(Graph &G, int from, int to, ll cap, bool revFlag, ll revCap) {
    G[from].push_back(Edge(to, (int)G[to].size(), cap));
    if(revFlag)
        G[to].push_back(Edge(from, (int)G[from].size() - 1, revCap));
}

void solve() {
    ll n, m;
    cin >> n >> m;
    vec<ll> x(m);
    REP(i, m) { cin >> x[i]; }
    vvec<ll> c(n, vec<ll>(m, 0));
    vec<ll> t(n, 0);
    REP(i, n) {
        REP(j, m) {
            cin >> c[i][j];
        }
        cin >> t[i];
    }

    vvec<ll> x2s(n, vec<ll>(m, 0));
    REP(i, n) {
        REP(j, m) {
            x2s[i][j] = c[i][j] * t[i];
        }
    }
    sort(all(x2s));

    REP(i, n) {
        if(t[i] == 100) {
            if(c[i] == x) {
                cout << "Yes" << en;
                return;
            } else {
                continue;
            }
        }
        vec<ll> x1(m);
        REP(j, m) {
            x1[j] = c[i][j] * t[i];
        }
        vec<ll> x2(m);
        bool flag = true;
        REP(j, m) {
            x2[j] = (x[j] * 100 - x1[j]) * 100;
            if(x2[j] % (100 - t[i])) {
                flag = false;
                break;
            }
            x2[j] /= 100 - t[i];
        }
        if(!flag)
            continue;
        if(x1 == x2)
            continue;
        if(upper_bound(all(x2s), x2) - lower_bound(all(x2s), x2)) {
            cout << "Yes" << en;
            return;
        }
    }
    cout << "No" << en;
    return;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // cout << fixed << setprecision(10);

    // ll t;
    // cin >> t;
    // REP(i, t - 1) {
    //     solve();
    // }

    solve();

    return 0;
}