#include <bits/stdc++.h>
using namespace std;
template <typename T>
void get_int(T &x) {
  char t = getchar();
  bool neg = false;
  x = 0;
  for (; (t > '9' || t < '0') && t != '-'; t = getchar())
    ;
  if (t == '-') neg = true, t = getchar();
  for (; t <= '9' && t >= '0'; t = getchar()) x = x * 10 + t - '0';
  if (neg) x = -x;
}
template <typename T>
void print_int(T x) {
  if (x < 0) putchar('-'), x = -x;
  short a[20] = {}, sz = 0;
  while (x > 0) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
const int inf = 0x3f3f3f3f;
const long long Linf = 1ll << 62;
const double pi = acos(-1.0);
int n, m, k, a[111][111], sum[111][111];
int main() {
  get_int(n), get_int(m), get_int(k);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      get_int(a[i][j]);
      sum[i][j] = a[i][j] + sum[i - 1][j];
    }
  }
  pair<int, int> ans = make_pair(0, 0);
  for (int j = 1; j <= m; j++) {
    pair<int, int> cur = make_pair(0, 0);
    for (int i = 1; i <= n; i++)
      if (a[i][j])
        cur = max(cur, make_pair(sum[min(n, i + k - 1)][j] - sum[i - 1][j],
                                 -sum[i - 1][j]));
    ans = make_pair(ans.first + cur.first, ans.second - cur.second);
  }
  printf("%d %d\n", ans.first, ans.second);
  return 0;
}
