#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int nx8[] = {1, 1, -1, -1, 2, 2, -2, -2};
int ny8[] = {2, -2, 2, -2, 1, -1, 1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n, m, k, a[105][105], b[105][105], res, tmp, res1;
int main() {
  scanf("%d %d", &n, &m);
  scanf("%d", &k);
  for (__typeof(n) i = (1); i <= (n); i++)
    for (__typeof(m) j = (1); j <= (m); j++) scanf("%d", &a[i][j]);
  for (__typeof(m) j = (1); j <= (m); j++) {
    for (int i = 1; i <= n; i++) {
      if (a[i][j] == 0) continue;
      tmp = min(k, n - i + 1);
      for (int h = 0; h < tmp; h++) {
        b[i][j] += a[h + i][j];
      }
    }
  }
  for (__typeof(m) j = (1); j <= (m); j++) {
    tmp = 0;
    for (__typeof(n) i = (1); i <= (n); i++) {
      tmp = max(tmp, b[i][j]);
    }
    for (__typeof(n) i = (1); i <= (n); i++)
      if (tmp == b[i][j])
        break;
      else if (a[i][j] == 1)
        res1++;
    res += tmp;
  }
  cout << res << " " << res1, printf("\n");
  return 0;
}
