#include <bits/stdc++.h>
using namespace std;

int a[110][110], w[110][110], f[110][20010];

int main()
{
	int n, m, t;
	cin >> n >> t >> m;
	for (int i = 1; i <= n; ++i)
	{
		for (int k = 1; k <= t; ++k)
		{
			cin >> a[k][i];
		}
	}
	for (int k = 1; k <= t; ++k)
	{
		sort(a[k] + 1, a[k] + n + 1);
		w[k][0] = 1;
		for (int i = 1; i <= n; ++i)
		{
			w[k][i] = w[k][i - 1] + a[k][i] * 2;
		}
	}
	for (int k = 1; k <= t; ++k)
	{
		for (int i = 1; i <= n; ++i)
		{
			for (int j = m; j >= 0; --j)
			{
				f[k][j] = max(f[k][j], f[k - 1][j]);
				if (j >= w[k][i])
				{
					f[k][j] = max(f[k][j], f[k - 1][j - w[k][i]] + i * k);
				}
			}
		}
	}
	cout << f[t][m] << endl;
	return 0;
}

本蒟蒻wa 40pts 求助大佬!!! QwQ