#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
using ull = unsigned long long;
const ull mod = (1ULL << 61) - 1;
ull mul(ull a,ull b)
{
	ull au = a >> 31;
	ull ad = a & ((1ULL << 31)-1);
	ull bu = b >> 31;
	ull bd = b & ((1ULL << 31)-1);
	ull mid = au*bd + bu*ad;
	ull midu = mid >> 30;
	ull midd = mid & ((1ULL << 30)-1);

	ull res = au*bu*2 + midu + (midd << 31) + ad*bd;

	res = (res >> 61) + (res & mod);
	if(res >= mod) res -= mod;

	return res;
}
mt19937_64 mt{(unsigned int)time(nullptr)};

void Main()
{
	ull base = mt() % mod;
	int N,M;
	cin >> N >> M;
	vector<int> X(M);
	for(int i = 0;i < M;i++)
	{
		cin >> X[i];
	}
	vector<vector<int>> C(N,vector<int>(M));
	vector<int> T(N);
	multiset<ull> S;
	vector<ull> H(N);
	for(int i = 0;i < N;i++)
	{
		for(int j = 0;j < M;j++)
		{
			cin >> C[i][j];
		}
		cin >> T[i];
		for(int j = 0;j < M;j++)
		{
			H[i] = mul(H[i],base) + T[i] * C[i][j];
			if(H[i] >= mod)
			{
				H[i] -= mod;
			}
		}
		S.insert(H[i]);
	}
	for(int i = 0;i < N;i++)
	{
		if(T[i] == 100)
		{
			if(C[i] == X)
			{
				cout << "Yes\n";
				return;
			}
			continue;
		}
		ull h = 0;
		bool ok = true;
		S.erase(S.find(H[i]));
		for(int j = 0;j < M;j++)
		{
			long long cur = 100 * X[j] - T[i] * C[i][j];
			cur *= 100;
			if(cur % (100 - T[i]) != 0)
			{
				ok = false;
				break;
			}
			cur /= 100 - T[i];
			h = mul(h,base) + cur;
			if(h >= mod)
			{
				h -= mod;
			}
		}
		if(ok)
		{
			if(S.find(h) != S.end())
			{
				cout << "Yes\n";
				return;
			}
		}
		S.insert(H[i]);
	}
	cout << "No\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}