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

/* #define int long long */
using ll = int64_t;
#define fr first
#define sc second
#define eb emplace_back
const char nl = '\n';

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");} 
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " <<"[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif

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

    int n, k; cin >> n >> k;
    int r[n + 1][k + 1], u[n + 1][k + 1];

    ll p[k + 1] = {};
    int cntPass[n + 1] = {};
    set<pair<int, int>> setCnt;
    set<pair<int, int>> kth[k + 1];

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

            kth[j].insert({r[i][j], i});
            if(p[j] >= r[i][j]) {
                ++cntPass[i];
            }
        }
        setCnt.insert({cntPass[i], i});
    }
    for(int i = 1; i <= n; ++i) for(int j = 1; j <= k; ++j) cin >> u[i][j];

    int res = 0;
    int best = (*setCnt.rbegin()).sc;
    while(cntPass[best] >= k) {
        auto tmp = setCnt.end();
        --tmp;
        setCnt.erase(tmp);
        for(int j = 1; j <= k; ++j) {
            ll q = p[j] + (ll)u[best][j];
            auto ptr = kth[j].upper_bound({p[j], n + 1});
            while(ptr != kth[j].end() && (*ptr).fr <= q) {
                setCnt.erase({cntPass[(*ptr).sc], (*ptr).sc});
                ++cntPass[(*ptr).sc];
                setCnt.insert({cntPass[(*ptr).sc], (*ptr).sc});
                ++ptr;
            }
            p[j] += u[best][j];
        }
        ++res;
        if(setCnt.size() == 0) break;
        best = (*setCnt.rbegin()).sc;
    }
    /* cout << "Loop over"; */
    /* cout << nl; */
    /* cout << best << nl; */
    cout << res << nl;
}