#include <iostream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;

const int N = 105, M = 105;
const long double eps=1e-10;

int n, m, id[105];
long double a[55][55], ans[55];

void Pivot(int l, int e) {
    swap(id[l + n], id[e]);
    long double t = a[l][e];
    a[l][e]=1;
    for (int i = 0; i <= n; ++i) a[l][i] /= t;
    for (int i = 0; i <= m; ++i)
        if (i != l && fabs(a[i][e]) > eps) {
            t = a[i][e];
            a[i][e] = 0;
            for (int j = 0; j <= n; ++j)
                a[i][j] -= t * a[l][j];
        }
}

bool Simplex() {
    while (1) {
        int l = 0, e = 0;
        long double mn = 1e+50;
        for (int i = 1; i <= n; ++i)
            if (a[0][i] > eps) {
                e = i;
                break;
            }
        if (!e) break;
        for (int i = 1; i <= m; ++i)
            if (a[i][e] > eps && a[i][0] / a[i][e] < mn)
                mn = a[i][0] / a[i][e], l = i;
        if (!l) return false;
        Pivot(l, e);
    }
    return true;
}

int main() {
    cin >> m >> n;
    for (int i = 1; i <= m; ++i) cin >> a[i][0];
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> a[j][i];
            a[j][i] /= 100;
        }
        cin >> a[0][i];
    }
    for (int i = 1; i <= n; ++i) id[i] = i;
    if (Simplex()) {
        double ans = -a[0][0];
        printf("%.2lf\n", ans + 1e-8);
    }
    else while(1);
    return 0;
}