#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<long long>x(m);
	rep(i, m)cin >> x[i];
	vector c(n, vector<long long>(m));
	vector<long long> t(n);
	map<vector<long long>, int>mp;
	rep(i, n) {
		rep(j, m) cin >> c[i][j];
		auto cc = c[i];
		cin >> t[i];
		rep(j, m)cc[j] *= t[i];
		mp[cc]++;
	}
	rep(i, m)x[i] *= 10000;
	bool chk = false;
	rep(i, n) {
		vector<long long>v(m);
		if (100 == t[i]) {
			auto cc = c[i];
			rep(j, m)cc[j] *= 100 * t[i];
			if (cc == x)chk = true;
			continue;
		}
		bool subchk = true;
		rep(j, m) {
			long long val = x[j];
			val -= 100 * t[i] * c[i][j];
			if (0 != val % (100 - t[i]))subchk = false;
			v[j] = val / (100 - t[i]);
		}
		if (!subchk)continue;
		if (mp.count(v)) {
			auto cnt = mp[v];
			if (cnt >= 2)chk = true;
			else if (1 == cnt) {
				auto cc = c[i];
				rep(j, m)cc[j] *= t[i];
				if (cc != v)chk = true;
			}
		}
	}
	cout << (chk ? "Yes" : "No") << endl;
	return 0;
}
// yesをnoと判定している