#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

using i64 = long long;
using pair = std::pair<int, int>;
using queue = __gnu_pbds::priority_queue<pair, std::less<>, __gnu_pbds::pairing_heap_tag>;

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  std::istream &fin = std::cin;
  std::ostream &fout = std::cout;

  int n, k;
  fin >> n >> k;

  std::vector<std::vector<int>> a(n, std::vector<int>(k)), b(a);

  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < k; ++j) {
      fin >> a[i][j];
    }
  }

  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < k; ++j) {
      fin >> b[i][j];
    }
  }

  std::vector<std::priority_queue<pair, std::vector<pair>, std::greater<>>> que(k);

  for (int i = 0; i < k; ++i) {
    for (int j = 0; j < n; ++j) {
      que[i].emplace(a[j][i], j);
    }
  }

  std::vector<i64> sum(k);
  std::vector<int> cnt(n);
  int res = 0;
  std::vector<queue::point_iterator> it(n);
  queue q;

  for (int i = 0; i < n; ++i) {
    it[i] = q.push({cnt[i], i});
  }

  while (true) {
    for (int i = 0; i < k; ++i) {
      while (!que[i].empty()) {
        auto [v, j] = que[i].top();

        if (v <= sum[i]) {
          ++cnt[j];
          q.modify(it[j], {cnt[j], j});
        } else {
          break;
        }

        que[i].pop();
      }
    }

    if (q.empty() || q.top().first < k) {
      break;
    }

    while (!q.empty()) {
      auto [c, i] = q.top();

      if (c == k) {
        for (int j = 0; j < k; ++j) {
          sum[j] += b[i][j];
        }
        
        ++res;
        q.pop();
      } else {
        break;
      }
    }
  }

  fout << res << '\n';
}