#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for(int i = 0; i < (n); i++)
const int mod = 1000000007;
#define ff first
#define ss second
#define pii pair<int, int>
signed main(){
int n, k;
cin >> n >> k;
int r[n][k];
int u[n][k];
rep (i, n) {
rep (j, k) {
cin>>r[i][j];
}
}
rep (i, n) {
rep (j, k) {
cin>>u[i][j];
}
}
vector<pii> v(n);
for (int i = 0; i < n; i++) {
v[i].ff = r[i][0];
v[i].ss = u[i][0];
}
sort(v.begin(), v.end());
int ans = 0;
int x = 0;
for (int i = 0; i < n; i++) {
if (v[i].ff > x) break;
ans++;
x += v[i].ss;
}
cout << ans;
}
