#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cstdio>

using namespace std;

int s[201][201],n,m,k;
int d[201][201];
char st[11];
int f[201][201];
bool y[201][201];
int dfs(int u,int l)
{
	if (u>m || l<=0) return 0;
	if (y[u][l]) return f[u][l];
	y[u][l]=true;
	int t=min(n,k);
	for (int i=0;i<=t;i++)
	{
		if (l-i+d[n][u]-d[n-i][u]<0) break;
		f[u][l]=max(f[u][l],s[n][u]-s[n-i][u]+dfs(u+1,l-i+d[n][u]-d[n-i][u]));
	}
	return f[u][l];
}

int main()
{
	freopen("gamea.in","r",stdin);
	freopen("gamea.out","w",stdout);
	scanf("%d%d%d",&n,&m,&k);
	for (int i=1;i<=n;i++)
	for (int j=1;j<=m;j++)
	{
		scanf("%d%s",&s[i][j],&st);
		if (st[0]=='Y') d[i][j]=d[i-1][j]+1;
		else d[i][j]=d[i-1][j];
		s[i][j]+=s[i-1][j];
	}
	printf("%d\n",dfs(1,k));
}