хз

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <string>
#include <deque>
#include <iomanip>
#include <cstddef>


using namespace std;

struct edge
{
    int cap, from, to, f;

};

const long double eps = 0.000000005;
const long double pi = 3.1415926535897932;
const long long inf = 1e9;

vector <edge> E;
vector <vector<int> > g;

int c[10000], r[10000], a[1000][1000], p[10000];
bool used[10000];

int S, I;

void add_edge(int cap, int from, int to)
{
    edge e;
    e.cap = cap;
    e.to = to;
    e.from = from;
    e.f = 0;
    g[from].push_back(E.size());
    E.push_back(e);
}

void dfs(int v)
{
    if (v == S)
        return;
    used[v] = 1;
    for (int i = 0; i < g[v].size(); i++)
    {
        int r = g[v][i];
        int to = E[r].to;
        if (!used[to] && E[r].cap > E[r].f)
        {
            p[to] = r;
            dfs(to);
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    freopen("input.txt", "r", stdin);//freopen("output.txt", "w", stdout);
    // freopen("slalom.in", "r", stdin);freopen("slalom.out", "w", stdout);

    int n, m;
    cin >> n >> m;

    I = 0;
    S = n + m + 1;

    g.resize(S + 1);


    for (int i = 0; i < n; i++)
        cin >> r[i];

    for (int i = 0; i < m; i++)
        cin >> c[i];

    int x;

    int ans = 0;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
        {
            cin >> x;
            a[i][j] = x;
            if (x != -1)
            {
                ans  += x;
                r[i] -= x;
                c[j] -= x;
            }
        }


    for (int i = 0; i < n; i++)
    {
        add_edge(r[i], I, i + 1);
        add_edge(0, i + 1, I);
    }

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            if (a[i][j] == -1)
        {
            add_edge(inf, i + 1, n + j + 1);
            add_edge(0, n + j + 1, i + 1);
        }


    for (int i = 0; i < m; i++)
    {
        add_edge(c[i], i + 1 + n, S);
        add_edge(0, S, i + n + 1);
    }


    while (1)
    {
        for (int i = 0; i <= S; i++)
        {
            p[i] = -1;
            used[i] = 0;
        }

        dfs(0);
        if (p[S] == -1)
            break;

        int f = 100000000;
        for (int i = S; i != I; i = E[p[i]].from)
        {
            int r = p[i];
            f = min(f, E[r].cap - E[r].f);
        }

        for (int i = S; i != I; i = E[p[i]].from)
        {
            int r = p[i];
            E[r].f += f;
            E[r ^ 1].f -= f;
        }
    }

    for (int i = 1; i <= n; i++)
        for (int j = 0; j < g[i].size(); j++)
        {
            if (E[g[i][j]].to >= n + 1 && E[g[i][j]].to <= n + m)
            {
                int r = g[i][j];
                ans += E[r].f;
            }
        }

    cout << ans << endl;

    return 0;
}