#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    //10000X = 100TC+(100-T)tc
    //tc = (10000X-100TC)/(100-T)
    set<vector<ll>> st;
    ll N, M;
    cin >> N >> M;
    vector<ll> X(M), T(N);
    for (int i=0; i<M; i++) cin >> X[i];
    vector C(N, vector<ll>(M));
    vector TC(N, vector<ll>(M));
    for (int i=0; i<N; i++){
        for (int j=0; j<M; j++) cin >> C[i][j];
        cin >> T[i];
    }

    for (int i=0; i<N; i++){
        for (int j=0; j<M; j++) TC[i][j] = C[i][j] * T[i];
        st.insert(TC[i]);
    }

    for (int i=0; i<N; i++){
        vector<ll> tc(M);
        bool f=1;
        if (T[i] == 100){
            if (C[i] == X){
                cout << "Yes" << endl;
                return 0;
            
            }
        }
        else{
            for (int j=0; j<M; j++){
                if ((X[j]*10000-TC[i][j]*100) % (100LL-T[i]) != 0){
                    f = 0;
                    break;
                }
                tc[j] = (X[j]*10000-TC[i][j]*100) / (100LL-T[i]);
            }
            if (tc == TC[i]) continue;
            if (f){
                if (st.count(tc)){
                    cout << "Yes" << endl;
                    return 0;
                }
            }
        }
    }
    cout << "No" << endl;

    return 0;
}