#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(n, vector<int>(m));
    vector<vector<int>> b(n, vector<int>(m));

    for (int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            cin >> a[i][j];

    for (int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            cin >> b[i][j];

    vector<vector<int>> h(m, vector<int>(n));
    for (int j = 0; j < m; j++) {
        for (int i = 0; i < n; i++)
            h[j][i] = i;
        sort(h[j].begin(), h[j].end(), [&](int x, int y) {return a[x][j] < a[y][j]; });
    }

    vector<int> cnt(n, m);
    vector<int> p(m);
    queue<int> q;
    vector<int> ptr(m);

    bool ok;
    int ans = 0;

    do {
        ok = 0;
        for (int j = 0; j < m; j++) {
            while (ptr[j] < n && a[h[j][ptr[j]]][j] <= p[j]) {
                int i = h[j][ptr[j]];
                if (--cnt[i] == 0) {
                    ok = 1;
                    ans++;
//                    cout << "i:" << i << '\n';
                    for (int k = 0; k < m; k++)
                        p[k] += b[i][k];

                }
                ptr[j]++;
            }
        }
    } while (ok);



    cout << ans << '\n';

    return 0;
}