#include<cstdio>
#include<bitset>
#define N 105
using namespace std;
bitset<202>f[N][N],kong;
int a[N][N],n,m,i,j,k,L;
int main()
{
    while (scanf("%d%d%d",&n,&m,&L)!=EOF)
    {
        for (i=1;i<=n;i++)
            for (j=1;j<=m;j++)
            {
                scanf("%d",&a[i][j]);
                f[i][j]=kong;
          }
        f[1][1][0]=1;
        if (a[1][1]<=L) f[1][1][a[1][1]]=1;
        for (i=1;i<=n;i++)
            for (j=1;j<=m;j++)
            {
                if (i>1) f[i][j]|=f[i-1][j]|(f[i-1][j]<<a[i][j]);
                if (j>1) f[i][j]|=f[i][j-1]|(f[i][j-1]<<a[i][j]);
          }
        for (i=L;i;i--)
            if (f[n][m][i]) break;
        printf("%d\n",i);
  }
}