#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>#define gc getchar()inline int read() {int x = 0, ff = 1;char c = gc;while(c < '0' || c > '9') {if(c == '-') ff = -1; c = gc;}while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = gc;return x * ff;
}const int N = 110;int f[N][N][15], sum[N][N], n, m, k, A[N][N];int main() {n = read(), m = read(), k = read();for(int i = 1; i <= n; i ++) for(int j = 1; j <= m; j ++) A[i][j] = read();if(m == 1) {for(int i = 1; i <= n; i ++) sum[i][0] = sum[i - 1][0] + A[i][1];for(int i = 1; i <= n; i ++)for(int j = 1; j <= k; j ++) {f[i][j][0] = f[i - 1][j][0];for(int s = 1; s <= i; s ++) f[i][j][0] = std:: max(f[i][j][0], f[s - 1][j - 1][0] + sum[i][0] - sum[s - 1][0]);}std:: cout << f[n][k][0];} else {for(int i = 1; i <= n; i ++) sum[i][1] = sum[i - 1][1] + A[i][1];for(int i = 1; i <= n; i ++) sum[i][2] = sum[i - 1][2] + A[i][2];for(int i = 1; i <= n; i ++)for(int j = 1; j <= n; j ++)for(int use = 1; use <= k; use ++) {f[i][j][use] = std:: max(f[i - 1][j][use], f[i][j - 1][use]);for(int s = 1; s <= i; s ++) f[i][j][use] = std:: max(f[i][j][use], f[s - 1][j][use - 1] + (sum[i][1] - sum[s - 1][1]));for(int s = 1; s <= j; s ++) f[i][j][use] = std:: max(f[i][j][use], f[i][s - 1][use - 1] + (sum[j][2] - sum[s - 1][2]));if(i == j)for(int s = 1; s <= i; s ++)f[i][j][use] = std:: max(f[i][j][use], f[s - 1][s - 1][use - 1] + (sum[i][1] - sum[s - 1][1]) + (sum[i][2] - sum[s - 1][2]));}std:: cout << f[n][n][k];}return 0;
}