#include <bits/stdc++.h>
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
long long int gcd(long long int a, long long int b) {
  return (a ? gcd(b % a, a) : b);
}
long long int modPow(long long int a, long long int b, long long int MOD) {
  long long int x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y) % MOD;
    }
    b /= 2;
    y = (y * y) % MOD;
  }
  return x;
}
long long int modInverse(long long int a, long long int p) {
  return modPow(a, p - 2, p);
}
using namespace std;
const int N = 101;
int A[N][N], B[N][N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k, offset;
  cin >> n >> m >> k;
  for (auto i = (1); i <= (n); i++) {
    for (auto j = (1); j <= (m); j++) {
      cin >> A[i][j];
      B[i][j] = B[i - 1][j] + A[i][j];
    }
  }
  int ans_score, ans_chnge;
  ans_score = ans_chnge = 0;
  for (auto i = (1); i <= (m); i++) {
    int score = 0;
    int mx_score = 0;
    offset = 0;
    int cnt = 0;
    for (auto j = (1); j <= (n); j++) {
      if (A[j][i] == 1) {
        int l = j;
        int r = min(n, j + min(k, n - j + 1) - 1);
        score = B[r][i] - B[l - 1][i];
        if (score > mx_score) {
          mx_score = score;
          cnt = offset;
        }
        offset++;
      }
    }
    ans_score += mx_score;
    ans_chnge += cnt;
  }
  cout << ans_score << " " << ans_chnge;
}
