#include using namespace std; void fast_io() { ios::sync_with_stdio(false); std::cin.tie(nullptr); } int main() { fast_io(); int n, m; cin >> n >> m; vector x(m); for (int i = 0; i < m; i++) { cin >> x[i]; } vector> c(n, vector(m)); vector t(n); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> c[i][j]; } cin >> t[i]; } set, 10>> st; for (int i = 0; i < n; i++) { array, 10> need; for (int j = 0; j < m; j++) { int a = 100 * x[j] - t[i] * c[i][j]; int b = 100 - t[i]; int g = gcd(a, b); if (a < 0) { a = -a; b = -b; } need[j] = {a / g, b / g}; } if (st.count(need)) { cout << "Yes\n"; return 0; } array, 10> data; for (int j = 0; j < m; j++) { int a = t[i] * c[i][j]; int b = 100; int g = gcd(a, b); if (a < 0) { a = -a; b = -b; } data[j] = {a / g, b / g}; } st.insert(data); } st.clear(); for (int i = n - 1; i >= 0; i--) { array, 10> need; for (int j = 0; j < m; j++) { int a = 100 * x[j] - t[i] * c[i][j]; int b = 100 - t[i]; int g = gcd(a, b); if (a < 0) { a = -a; b = -b; } need[j] = {a / g, b / g}; } if (st.count(need)) { cout << "Yes\n"; return 0; } array, 10> data; for (int j = 0; j < m; j++) { int a = t[i] * c[i][j]; int b = 100; int g = gcd(a, b); if (a < 0) { a = -a; b = -b; } data[j] = {a / g, b / g}; } st.insert(data); } cout << "No\n"; }