#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char *x) { cout << '\"' << x << '\"'; }
void __print(const string &x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cout << '{';
  __print(x.first);
  cout << ',';
  __print(x.second);
  cout << '}';
}
template <typename T>
void __print(const T &x) {
  int first = 0;
  cout << '{';
  for (auto &i : x) cout << (first++ ? "," : ""), __print(i);
  cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cout << ", ";
  _print(v...);
}
template <class T>
void remdup(vector<T> &v) {
  sort((v).begin(), (v).end());
  v.erase(unique((v).begin(), (v).end()), end(v));
}
template <typename T>
struct cmp {
  bool operator()(const T &p1, const T &p2) {}
};
const long long N = 1e6 + 100;
const long long mod = 1e9 + 7;
const long long X = 2e5 + 100;
long long rsum[N], csum[N];
int main() {
  long long n, m, k, p, x;
  cin >> n >> m >> k >> p;
  vector<long long> row(n, 0), colom(m, 0);
  for (long long i = (0); i < (n); ++i)
    for (long long j = (0); j < (m); ++j) {
      cin >> x;
      row[i] += x;
      colom[j] += x;
    }
  multiset<long long> rowsum, colomsum;
  for (long long i = (0); i < (n); ++i) rowsum.insert(row[i]);
  for (long long i = (0); i < (m); ++i) colomsum.insert(colom[i]);
  for (long long i = (1); i < (k + 1); ++i) {
    long long val = *rowsum.rbegin();
    rowsum.erase(rowsum.find(val));
    rowsum.insert(val - m * p);
    rsum[i] = rsum[i - 1] + val;
    val = *colomsum.rbegin();
    colomsum.erase(colomsum.find(val));
    colomsum.insert(val - n * p);
    csum[i] = csum[i - 1] + val;
  }
  long long ans = -(1LL << 62);
  for (long long i = (0); i < (k + 1); ++i)
    ans = max(ans, rsum[i] + csum[k - i] - (i * (k - i) * p));
  cout << ans << "\n";
  return 0;
}
