// #pragma GCC diagnostic warning "-std=c++11"
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#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 stop exit(0)
#define sz(x) (int)x.size()
#define pause system("pause")
#define all(x) (x).begin(),(x).end()
#define deb(x) cout << #x << "-" << x  << endl
 
typedef char chr;
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;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            cin >> a;
            v[i].pb({a,j});
            if (a == 0) {
                cnt[i]++;
                if (cnt[i] == k) {
                    vr.pb(i);
                }
            }
            
        }
    }
    int c[n+10][k+10];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            cin >> c[i][j];
        }
    }

    for (int i = 0; i < max(n,k); i++) {
        pref[i] = -1;
        cnt[i] = k;
    }
    for (int i = 0; i < sz(vr); i++) {
        cnt[vr[i]] = k;
    }

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

    for (int i = 0; i < sz(vr); i++) {
        for (int j = 1; j <= k; j++) {
            p[j] += c[vr[i]][j];
            while (pref[j]+1<sz(v[j])) {
                if (p[j] >= v[vr[i]][pref[i]+1].ff) {
                    pref[i] += 1;
                    cnt[v[vr[i]][pref[i]+1].ss] += 1;
                    if (cnt[v[vr[i]][pref[i]+1].ss] == k) {
                        vr.pb(v[vr[i]][pref[i]+1].ss);
                    }
                } else {
                    break;
                }
            }
        }   
    }
    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;
 
}