#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<vector<ll>> need(n, vector<ll>(k));
	vector<vector<ll>> gain(n, vector<ll>(k));
	for(int i = 0; i < n; i++)
		for(int j = 0; j < k; j++)
			cin>>need[i][j];
	
	for(int i = 0; i < n; i++)
		for(int j = 0; j < k; j++)
			cin>>gain[i][j];
			
	bool vis[n];
	vl current(k, 0);
	memset(vis, false, sizeof vis);
	queue<int> q;
	for(int i = 0; i < n; i++){
		bool can = true;
		for(int j = 0; j < k; j++){
			if(need[i][j] > current[j]){
				can = false;
				break;
			}
		}
		if(can && !vis[i]){
			q.push(i);
			vis[i] = true;
		}
	}
//	cout<<"HERE"<<endl;
	int ans = 0;
	while(!q.empty()){
		int at = q.front();
		q.pop();
		ans++;
//		cout<<at+1<<endl;
		for(int j = 0; j < k; j++){
			current[j] += gain[at][j];
		}
		for(int i = 0; i < n; i++){
			if(vis[i])	continue;
			bool can_now = true;
			for(int j = 0; j < k; j++){
				if(need[i][j] > current[j]){
					can_now = false;
					break;
				}
			}
			if(can_now && !vis[i]){
				q.push(i);
				vis[i] = true;
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}