#include <bits/stdc++.h>
#define ll long long
const int N = 1e6+5;
const ll mod = 998244353;
using namespace std;
vector<ll> r[N], u[N];
vector<pair<ll,ll>> huh;
int n,k;
void solve()
{
cin >> n >> k;
for (int i=1;i<=n;i++)
{
for (int j=1;j<=k;j++)
{
ll op; cin >> op;
r[i].push_back(op);
}
}
for (int i=1;i<=n;i++)
{
for (int j=1;j<=k;j++)
{
ll op; cin >> op;
u[i].push_back(op);
}
}
if (n == 1)
{
for (int i=1;i<=k;i++)
{
if (r[1][i] > 0)
{
cout << "0\n";
return;
}
}
cout << "1\n";
return;
}else if (k == 1)
{
ll sus = 0;
for (int i=1;i<=n;i++)
{
huh.push_back(make_pair(r[i][1],u[i][1]));
}
sort(huh.begin(),huh.end());
int ans = 0;
for (pair<ll,ll> i: huh)
{
if (sus >= i.first)
{
sus += i.second;
ans++;
}else
{
break;
}
}
cout << ans << '\n';
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
solve();
}
