#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 1e6+10; bitset<N> used; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; vector<ll> p(n); vector<vector<ll>> r(n, vector<ll>(k, 0)), u(n, vector<ll>(k, 0)); for(auto &e : r) for(auto &ee : e) cin >> ee; for(auto &e : u) for(auto &ee : e) cin >> ee; int res = 0; while(1){ auto can = [&](int i){ for(int j = 0; j < k; ++j){ if(p[j] < r[i][j]) return false; } for(int j = 0; j < k; ++j){ p[j] += u[i][j]; } return true; }; bool ok = 1; for(int i = 0; i < n; ++i){ if(!used[i] && can(i)){ used[i] = 1; ok = 0; res++; } } if(ok) break; } cout << res << '\n'; }