#pragma GCC optimize("O3,inline")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using ii = pair<int, int>;
using iii = pair<int, ii>;
using pvii = pair<vector<int>, ii>;
constexpr int MAXN = 20000 + 5;
constexpr int INF = 1e18 + 5;
constexpr int LOG = 20;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int N, M, K; cin >> N >> M >> K;
int ans = N * M;
vector<pvii> inp(N);
for (int i = 0; i < N; ++i) {
vector<int> lol(M); for (int j = 0; j < M; ++j) cin >> lol[j];
sort(lol.begin(), lol.end());
int s = 0; for (int j = 0; j < M; ++j) s += lol[j];
inp[i] = pvii{lol, ii{s, i}};
}
sort(inp.begin(), inp.end(), [&](const pvii &a, const pvii &b) {
return a.second.first < b.second.first || a.second.first == b.second.first && a.second.second > b.second.second;
});
vector<int> max_with_lb(M*K+2);
for (int i = N-1; i >= 0; --i) {
int maxRem = (!i ? inp[i].second.first : inp[i].second.first - inp[i-1].second.first);
if (i && inp[i].second.second > inp[i-1].second.second) maxRem--;
bool off = i != N-1 && inp[i+1].second.second > inp[i].second.second;
int nxt = (i == N-1 ? M * K : inp[i+1].second.first);
vector<int> &v = inp[i].first;
int s = inp[i].second.first;
vector<bitset<105>> dp_prev(maxRem + 1);
vector<bitset<105>> dp_curr(maxRem + 1);
dp_curr[0].set(0);
for (int j = 0; j < M; ++j) {
dp_prev = dp_curr;
for (int k = v[j]; k <= maxRem; ++k) {
dp_curr[k] |= dp_prev[k - v[j]] << 1;
}
}
for (int r = 0; r <= maxRem; ++r) {
max_with_lb[s - r] = max(max_with_lb[s - r], max_with_lb[s - r + 1]);
for (int j = 0; j <= M; ++j) {
int lb = s - r + j * K + off;
if (dp_curr[r][j] && lb <= nxt) {
max_with_lb[s - r] = max(max_with_lb[s - r], max_with_lb[lb] + j);
}
}
}
}
cout << ans - max_with_lb[0];
}
/*
2 3 5
3 0 4
4 4 4
ans should be 4
*/
