#include <bits/stdc++.h>
using namespace std;

#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl '\n'
#define ff first
#define ss second
#define stop exit(0)
#define sz(x) (int)x.size()
#define pause system("pause")
#define all(x) (x).begin(),(x).end()
#define deb(x) cout << #x << "-" << x  << endl

typedef string str;
typedef long long ll;
typedef vector<int> vii;
typedef pair<int, int> pii;

const long long INF = LLONG_MAX;
const int inf = INT_MAX;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};
const double PI = 2 * acos(0.0);

const int N = 1e6 + 5;

int n, k, a;
vector<vector<pii>> v(N);
int pref[N], cnt[N];
vii vr;
int p[N];

inline void test_case()
{
    cin >> n >> k;
    
    vector<vector<int>> r(n, vector<int>(k));
    vector<vector<int>> u(n, vector<int>(k));
    
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            cin >> r[i][j];
        }
    }

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            cin >> u[i][j];
        }
    }

    vector<bool> completed(n, false);
    int completed_count = 0;
    
    bool progress = true;
    while (progress)
    {
        progress = false;
        for (int i = 0; i < n; i++)
        {
            if (completed[i]) continue;
            
            bool can_complete = true;
            for (int j = 0; j < k; j++)
            {
                if (p[j] < r[i][j])
                {
                    can_complete = false;
                    break;
                }
            }
            
            if (can_complete)
            {
                progress = true;
                completed[i] = true;
                completed_count++;
                for (int j = 0; j < k; j++)
                {
                    p[j] += u[i][j];
                }
            }
        }
    }
    
    cout << completed_count << endl;
}

signed main()
{
    ios_base ::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int T = 1;
    // cin >> T;
    while (T--)
    {
        test_case();
    }

    return 0;
}