# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iostream>
# include <vector>
# include <queue>
# include <stack>
# include <map>
# include <set>
# include <cmath>
# include <algorithm>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi 3.1415926535
# define eps 1e-9
# define MOD 100000007
# define INF 1000000000
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(int i=a; i<=n; ++i)
# define FO(i,a,n) for(int i=a; i<n; ++i)
# define bug puts("H");
# define lch p<<1,l,mid
# define rch p<<1|1,mid+1,r
# define mp make_pair
# define pb push_back
typedef pair<int,int> PII;
typedef vector<int> VI;
# pragma comment(linker, "/STACK:1024000000,1024000000")
typedef long long LL;
int Scan() {int res=0, flag=0;char ch;if((ch=getchar())=='-') flag=1;else if(ch>='0'&&ch<='9') res=ch-'0';while((ch=getchar())>='0'&&ch<='9')  res=res*10+(ch-'0');return flag?-res:res;
}
void Out(int a) {if(a<0) {putchar('-'); a=-a;}if(a>=10) Out(a/10);putchar(a%10+'0');
}
const int N=2505;
//Code begin...int val[55][55], dp[55][55][2], ans[2505];
char s[55][55];int main ()
{int n, m, T;scanf("%d%d%d",&n,&m,&T);FOR(i,1,n) scanf("%s",s[i]+1);FOR(i,1,n) {mem(dp,0);FOR(j,1,m) FOR(k,1,j) {dp[j][k][0]=max(dp[j-1][k][0],max(dp[j-1][k-1][0],dp[j-1][k-1][1]))+(s[i][j]=='0');dp[j][k][1]=max(dp[j-1][k][1],max(dp[j-1][k-1][0],dp[j-1][k-1][1]))+(s[i][j]=='1');}FOR(j,1,m) val[i][j]=max(dp[m][j][0],dp[m][j][1]);}FOR(i,1,n) for (int j=T; j>=0; --j) for (int k=min(j,m); k>=1; --k)ans[j]=max(ans[j],ans[j-k]+val[i][k]);printf("%d\n",ans[T]);return 0;
}