#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template<const unsigned int MOD> struct prime_modint {
    using mint = prime_modint;
    unsigned int v;
    prime_modint() : v(0) {}
    prime_modint(unsigned int a) { a %= MOD; v = a; }
    prime_modint(unsigned long long a) { a %= MOD; v = a; }
    prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    static constexpr int mod() { return MOD; }
    mint& operator++() {v++; if(v == MOD)v = 0; return *this;}
    mint& operator--() {if(v == 0)v = MOD; v--; return *this;}
    mint operator++(int) { mint result = *this; ++*this; return result; }
    mint operator--(int) { mint result = *this; --*this; return result; }
    mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }
    mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }
    mint& operator*=(const mint& rhs) {
        v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);
        return *this;
    }
    mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    mint pow(long long n) const {
        assert(0 <= n);
        mint r = 1, x = *this;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { assert(v); return pow(MOD - 2); }
    friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }
    friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }
    friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }
};
//using mint = prime_modint<1000000007>;
using mint = prime_modint<998244353>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    array<ll, 10> G{};
    for(int i = 0; i < m; i++){
        cin >> G[i];
        G[i] *= 1'00'00;
    }
    vector<array<ll,11>> A(n);
    vector<ll> T(n);
    bool hz = false;
    for(int i = 0; i < n; i++){
        A[i].fill(0);
        for(int j = 0; j < m; j++) cin >> A[i][j];
        cin >> T[i];
        for(int j = 0; j < m; j++) A[i][j] *= T[i];
        A[i][10] = i;
        if(T[i] == 0) hz = true;
    }
    sort(A.begin(), A.end());

    auto f100 = [&](int p){
        for(int i = 0; i < m; i++){
            if(G[i] != 100 * A[p][i]) return false;
        }
        return true;
    };

    auto fm = [&](array<ll,11> lhs, array<ll,11> rhs){
        for(int i = 0; i < m; i++){
            if(lhs[i] != rhs[i]) return false;
        }
        return lhs[10] != -rhs[10];
    };

    for(int i = 0; i < n; i++){
        int p = A[i][10];
        if(T[p] == 100){
            if(f100(p)){
                cout << "Yes\n";
                return 0;
            }
            continue;
        }
        if(hz && f100(p)){
            cout << "Yes\n";
            return 0;
        }
        array<ll,11> tmp{};
        for(int j = 0; j < m; j++){
            ll v = G[j] - 100 * A[i][j];
            ll div = 100 - T[p];
            if(v % div != 0){
                tmp[10] = -2;
                break;
            }
            tmp[j] = v / div;
        }
        if(tmp[10] == -2) continue;
        tmp[10] = -p;
        int j = lower_bound(A.begin(), A.end(), tmp) - A.begin();
        if(j < n && fm(A[j], tmp)){
            cout << "Yes\n";
            return 0;
        }
        j++;
        if(j < n && fm(A[j], tmp)){
            cout << "Yes\n";
            return 0;
        }
    }
    cout << "No\n";
}