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

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()

// #define int long long
// #define int unsigned long long

// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>

void open_file(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

// const ll mod = 1e9 + 7;
// const ll mod = 998244353;

const ll inf = 1e9;
const ll biginf = 1e18;
// const int maxN = 5 * 1e5 + 25;

void solve() {
    int n, m;
    cin >> n >> m;
    int r[n + 1][m + 1], u[n + 1][m + 1];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> r[i][j];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> u[i][j];
    vector<pii> v[m + 1];
    int pos[m + 1] = {}, val[m + 1] = {}, cnt[m + 1] = {}, ans = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            v[j].pb({r[i][j], i});
    for (int i = 1; i <= m; i++)
        sort(v[i].begin(), v[i].end());
    for (int _ = 1; _ <= n; _++) {
        for (int i = 1; i <= m; i++) {
            for ( ; pos[i] < v[i].size(); pos[i]++) {
                if (val[i] < v[i][pos[i]].ff) break;
                cnt[v[i][pos[i]].sc]++;
                if (cnt[v[i][pos[i]].sc] == m) {
                    ans++;
                    for (int j = 1; j <= m; j++)
                        val[j] += u[v[i][pos[i]].sc][j];
                }
            }
        }
    } cout << ans;
}
int32_t main() { 
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        cout << '\n';
    }
    return 0;
}