#include <iostream>
#include <set>
#include <vector>

using namespace std;
using i64 = long long;

int main() {
    int n, m;
    cin >> n >> m;
    vector<i64> x(m);
    for (int i = 0; i < m; i++) cin >> x[i];
    vector cards(n, vector<i64>(m));
    vector<i64> t(n);
    multiset<vector<i64>> s;
    vector<vector<i64>> H(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> cards[i][j];
        }
        cin >> t[i];
        vector<i64> h(m);
        for (int j = 0; j < m; j++) h[j] = cards[i][j] * t[i];
        s.emplace(h);
        H[i] = h;
    }
    for (int i = 0; i < n; i++) {
        if (t[i] == 100) {
            if (cards[i] == x) {
                cout << "Yes\n";
                return 0;
            }
        }
        else {
            vector<i64> y(m);
            bool f = true;
            for (int j = 0; j < m; j++) {
                y[j] = (10'000ll * x[j] - 100ll * t[i] * cards[i][j]);
                if (y[j] % (100ll - t[i]) == 0) {
                    y[j] /= (100ll - t[i]);
                }
                else f = false;
            }
            if (!f) continue;
            s.erase(s.find(H[i]));
            if (s.contains(y)) {
                cout << "Yes\n";
                return 0;
            }
            s.emplace(H[i]);
        }
    }
    cout << "No\n";

    return 0;
}