#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<map>
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m;
    cin>>n>>m;
    vector<ll> x(m);
    for(int i = 0;i<m;i++) cin>>x[i];
    vector<vector<ll>> c(n,vector<ll>(m));
    vector<ll> t(n);
    for(int i = 0;i<n;i++){
        for(int j = 0;j<m;j++) cin>>c[i][j];
        cin>>t[i];
    }
    map<vector<ll>,int> memo;
    vector<vector<ll>> w(n);
    for(int i = 0;i<n;i++){
        vector<ll> use(m);
        for(int j = 0;j<m;j++) use[j] = c[i][j] * t[i];
        memo[use]++;
        w[i] = use;
    }
    for(int i = 0;i<n;i++){
        vector<ll> want(m);
        if(t[i]==100){
            if(x==c[i]){
                cout<<"Yes\n";
                return 0;
            }
            continue;
        }
        bool fn = true;
        for(int j = 0;j<m;j++){
            want[j] = 10000 * x[j] - 100 * t[i] * c[i][j];
            ll now = 100 - t[i];
            if(now!=0){
                if(want[j]%now!=0) fn = false;
                else want[j] /= now;
            }
        }
        if(!fn) continue;
        bool ok = false;
        if(w[i]==want){
            if(memo[want]>=2) ok = 1;
        }else{
            if(memo[want]>=1) ok = 1;
        }
        if(ok) {
            cout<<"Yes\n";
            return 0;
        }
    }
    cout<<"No\n";
    return 0;
}