#include <bits/stdc++.h>
using namespace std;

typedef long long ll  ;

const int N = 1e5 + 10;

int main() {
    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);
    int k, r;
    cin >> k >> r;
    vector<ll> have(k);
    for (int i = 0; i < k; ++i) {
        cin >> have[i];

    }
    vector<long long> b(r);
    vector<vector<long long>> a(r, vector<long long>(k));
    for (int i = 0; i < r; ++i) {
        for (int j = 0; j < k; ++j) {
            cin >> a[i][j];
        }
        cin >> b[i];
    }
    ll ans = 0;
    for (int i = 0; i < r; ++i) {
        ll val = LLONG_MAX;
        for (int j = 0; j < k; ++j) {
            if (a[i][j] == 0) { continue; }
            val = min(val, have[j] / a[i][j]);
        }
        ans = max(ans, val * b[i]);
    }
    cout << ans;
}