/*
    * @file T3.cpp
    * @author Zhoumouren
    * @brief 
    * @version 0.1
    * @date 2024-08-15
    * 
    * @copyright Copyright (c) 2024

Easy.
We can count the number of theme then use queue like BFS to Solve it.

*/

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

typedef long long ll;
#define int long long 

namespace FastOI 
{
    template<typename T> inline T read(T& x) {
        x = 0;
        int f = 1;
        char ch;
        while (!isdigit(ch = getchar())) if (ch == '-') f = -1;
        while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
        x *= f;
        return x;
    }
    template<typename T, typename... Args> inline void read(T& x, Args &...x_) {
        read(x);
        read(x_...);
        return;
    }
    inline ll read() {
        ll x;
        read(x);
        return x;
    }
    inline void read(char *s) {
        scanf("%s", s + 1);
    }
};
using namespace FastOI;

const int N = 1e6 + 10;

int n, k;
vector<int >r[N];
vector<int >u[N];

vector<int >v[N];
int can[N];
int cnt[N], nowc[N];
queue<int >q;

void Input() {
    read(n, k);
    for(int i = 1; i <= n; i++) {
        r[i].push_back(0);
        for(int j = 1; j <= k; j++) {
            r[i].push_back(read());
            if(r[i][j] == 0) {
                can[i]++;
                cnt[j]++;
                v[j].push_back(i);
            }
        }
        if(can[i] == k) q.push(i);
    }
    for(int i = 1; i <= n; i++) {
        u[i].push_back(0);
        for(int j = 1; j <= k; j++) {
            u[i].push_back(read());
        }
    }
}

void Work() {
    for(int j = 1; j <= k; j++) {
        sort(v[j].begin(), v[j].end(), [&](int x, int y) {
            return r[x][j] < r[y][j];
        });
    }
    int ans = q.size();
    while(!q.empty()) {
        int f = q.front(); q.pop();
        for(int i = 1; i <= k; i++) {
            nowc[i] += u[f][i];
            while(cnt[i] < n && r[v[i][cnt[i]]][i] <= nowc[i]){
                int x = v[i][cnt[i]++];
                can[x]++;
                if(can[x] == k) {
                    q.push(x);
                    ans++;
                }
            }
        }
    }
    printf("%lld", ans);
}

signed main() {
    int T = 1;
    while(T--) {
        Input();
        Work();
    }
    return 0;
}