#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
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;
}

int main(){
    ll n,m;cin >> n >> m;
    vl x(m);rep(i,m)cin >> x[i],x[i]*=10000;
    vvl c(n,vl(m));
    vl t(n);
    rep(i,n){
        rep(j,m)cin >> c[i][j];
        cin >> t[i];
    }
    set<vl> st;
    rep(i,n){
        vl nv(m);
        rep(j,m)nv[j]=c[i][j]*t[i];
        st.insert(nv);
    } 
    bool ok=false;
    rep(i,n){
        vl nv(m);
        rep(j,m)nv[j]=c[i][j]*t[i];
        st.erase(nv);
        vl need(m,-1);
        if(t[i]==100){
            bool judge=true;
            rep(j,m){
                if(x[j]!=t[i]*c[i][j]*100)judge=false;
            }
            ok|=judge;
            st.insert(nv);
            continue;
        }
        rep(j,m){
            ll left=x[j]-t[i]*c[i][j]*100;
            ll r=100-t[i];
            if(left%r==0){
                need[j]=left/r;
            }
        }
        if(st.count(need))ok=true;
        st.insert(nv);
    }
    cout << (ok? "Yes":"No") << endl;
}