#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int main(){
	int n, k;
	cin>>n>>k;
	vector<pair<ll, int>> need[k];
	vector<vector<ll>> gain(n, vector<ll>(k));
	queue<int> q;
	for(int i = 0; i < n; i++)
	{
		vi in(k);
		for(int j = 0; j < k; j++)	cin>>in[j];
		
		if(in == vector<int>(k, 0)){
			q.push(i);
		}
		else{
			for(int j = 0; j < k; j++){
				need[j].push_back(mp(in[j], i));
			}
		}
	}
	for(int i = 0; i < k; i++)
		sort(need[i].begin(), need[i].end());
	for(int i = 0; i < n; i++)
		for(int j = 0; j < k; j++)
			cin>>gain[i][j];
	
	int ans = 0;
	vi cnt(n, k);
	vl cur(k, 0), p(k, 0);
	while(!q.empty()){
		int at = q.front();
		q.pop();
		ans++;
		for(int j = 0; j < k; j++){
			cur[j] += gain[at][j];
			while(p[j] < need[j].size() && need[j][p[j]].first <= cur[j]){
				if(!--cnt[need[j][p[j]].second]){
					q.push(need[j][p[j]].second);
				}
				p[j]++;
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}