#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;
    map<vector<int>, vector<int>> mp;
    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];
    int ans = 0;
    set<vector<int>> st;
    for (int i = 1; i <= n; i++) {
        vector<int> tmp;
        for (int j = 1; j <= m; j++) tmp.pb(r[i][j]);
        st.insert(tmp); mp[tmp].pb(i);
    } vector<int> p(m, 0);
    for (int i = 1; i <= n; i++) {
        auto it = st.upper_bound(p);
        if (it == st.begin()) break;
        ans += mp[*it].size(); it--;
        for (int pos : mp[*it]) {
            for (int j = 1; j <= m; j++)
                p[j] += u[pos][j];
        } st.erase(it);
    } 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;
}