#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int n, m;
	cin >> n >> m;
	vector<int> x(m);
	cin >> x;
	vector<vector<int>> c(n, vector<int>(m));
	vector<int> t(n);
	rep(i, n){
		cin >> c[i] >> t[i];
	}
	set<vector<int>> se;
	rep(i, n){
		vector<int> tmp(m);
		rep(j, m) tmp[j] = c[i][j] * t[i];
		se.insert(tmp);
	}
	rep(i, n){
		if(t[i] == 100){
			if(c[i] == x){
				cout << "Yes\n";
				return 0;
			}
		}else{
			bool fail = false;
			vector<int> tmp(m);
			rep(j, m) tmp[j] = 10000 * x[j] - 100 * t[i] * c[i][j];
			rep(j, m){
				if(tmp[j] % (100 - t[i]) != 0) fail = true;
				else tmp[j] /= 100 - t[i];
			}
			if(fail) continue;
			if(se.find(tmp) != se.end()){
				cout << "Yes\n";
				return 0;
			}
		}
	}
	cout << "No\n";
	return 0;
}