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

#define int long long
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl '\n'
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()

typedef string str;
typedef long long ll;
typedef vector<int> vii;
typedef pair<int, int> pii;

const long long INF = LLONG_MAX;
const int inf = INT_MAX;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};
const double PI = 2 * acos(0.0);

const int N = 1e6 + 5;

int n, k, a;
vector<vector<pii>> v(N);
int pref[N], cnt[N];
vii vr;
int p[N];

inline void test_case()
{
    cin >> n >> k;

    // Clear the data structures for multiple test cases
    for (int i = 0; i <= k; i++) {
        v[i].clear();
    }
    vr.clear();
    fill(cnt, cnt + n + 10, 0);
    fill(pref, pref + max(n, k) + 10, -1);
    fill(p, p + k + 10, 0);

    vector<vector<int>> r(n + 1, vector<int>(k + 5));
    vector<vector<int>> u(n + 1, vector<int>(k + 5));

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            cin >> r[i][j];
            v[j].pb({r[i][j], i});
            if (r[i][j] == 0) {
                cnt[i]++;
            }
        }
        if (cnt[i] == k) {
            vr.pb(i);
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            cin >> u[i][j];
        }
    }

    for (int i = 1; i <= k; i++) {
        sort(all(v[i]));
    }

    for (int i = 0; i < sz(vr); i++) {
        int module = vr[i];
        for (int j = 1; j <= k; j++) {
            p[j] += u[module][j];
            while (pref[j] + 1 < sz(v[j]) && p[j] >= v[j][pref[j] + 1].ff) {
                pref[j]++;
                int next_module = v[j][pref[j]].ss;
                cnt[next_module]++;
                if (cnt[next_module] == k) {
                    vr.pb(next_module);
                }
            }
        }
    }
    
    cout << sz(vr) << endl;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int T = 1;
    // cin >> T;
    while (T--) {
        test_case();
    }

    return 0;
}