#include <iostream> #include <vector> #include <algorithm> using namespace std; long long N, K, P, C[509][6]; vector<long long> vec; int main() { cin >> N >> K >> P; for (int i = 0; i < N; i++) { for (int j = 0; j < K; j++) cin >> C[i][j]; } if (K == 1) { for (int i = 0; i < N; i++) vec.push_back(C[i][0]); } if (K == 2) { for (int i = 0; i < N; i++) { for (int j = i + 1; j < N; j++) vec.push_back(max(C[i][0], C[j][0]) + max(C[i][1], C[j][1])); } } sort(vec.begin(), vec.end()); reverse(vec.begin(), vec.end()); cout << vec[P - 1] << endl; return 0; }