#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#define ll long long
using namespace std;
const int MX = 1010;
typedef pair<ll, ll> ii;
int main() {
ll n, k; cin >> n >> k;
ll s[MX][MX];
ll cur[MX];
for (ll i = 0; i < n; i++) {
cur[i] = 0;
}
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < k; j++) {
ll a; cin >> a;
if (j) {
s[i][j] = s[i][j-1]+a;
}
else {
s[i][j] = a;
}
}
}
priority_queue<ii, vector<ii>, greater<ii> > pq;
for (ll i = 0; i < n; i++) {
pq.push(ii(0, i));
}
ll ans = 0;
while (!pq.empty()) {
ii u = pq.top();
pq.pop();
ll sc = u.first, id = u.second;
if (cur[id] < k) {
sc = s[id][cur[id]++];
pq.push(ii(sc, id));
ii v = pq.top();
if (v.second != id) {
ans++;
}
}
}
cout << ans << '\n';
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8cXVldWU+CiNkZWZpbmUgbGwgbG9uZyBsb25nCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGludCBNWCA9IDEwMTA7CnR5cGVkZWYgcGFpcjxsbCwgbGw+IGlpOwogCmludCBtYWluKCkgewoJbGwgbiwgazsgY2luID4+IG4gPj4gazsKCWxsIHNbTVhdW01YXTsKCWxsIGN1cltNWF07IAoJZm9yIChsbCBpID0gMDsgaSA8IG47IGkrKykgewoJCWN1cltpXSA9IDA7Cgl9Cglmb3IgKGxsIGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJZm9yIChsbCBqID0gMDsgaiA8IGs7IGorKykgewoJCQlsbCBhOyBjaW4gPj4gYTsKCQkJaWYgKGopIHsKCQkJCXNbaV1bal0gPSBzW2ldW2otMV0rYTsKCQkJfQoJCQllbHNlIHsKCQkJCXNbaV1bal0gPSBhOwoJCQl9CgkJfQoJfQoJcHJpb3JpdHlfcXVldWU8aWksIHZlY3RvcjxpaT4sIGdyZWF0ZXI8aWk+ID4gcHE7Cglmb3IgKGxsIGkgPSAwOyBpIDwgbjsgaSsrKSB7IAoJCXBxLnB1c2goaWkoMCwgaSkpOwoJfQoJbGwgYW5zID0gMDsKCXdoaWxlICghcHEuZW1wdHkoKSkgewoJCWlpIHUgPSBwcS50b3AoKTsKCQlwcS5wb3AoKTsKCQlsbCBzYyA9IHUuZmlyc3QsIGlkID0gdS5zZWNvbmQ7CgkJaWYgKGN1cltpZF0gPCBrKSB7CgkJCXNjID0gc1tpZF1bY3VyW2lkXSsrXTsKCQkJcHEucHVzaChpaShzYywgaWQpKTsKCQkJaWkgdiA9IHBxLnRvcCgpOwoJCQlpZiAodi5zZWNvbmQgIT0gaWQpIHsKCQkJCWFucysrOwoJCQl9CgkJfQoJfQoJY291dCA8PCBhbnMgPDwgJ1xuJzsKCXJldHVybiAwOwp9IA==