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

inline int Max(int a,int b){return a>b?a:b;}

int n,m,K,ans;
int v[N][N],w[N][N],f[N][N];

int main(){
	cin>>n>>m>>K;
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			string ch;
			cin>>v[i][j]>>ch;
			if(ch[0]=='N')w[i][j]=1;
		}
	}
	for(int i=1;i<=m;++i){
		int val=0,cost=0;
		for(int k=K;k>=0;--k)f[i][k]=f[i-1][k]; 
		for(int j=n;j>=1;--j){
			val+=v[j][i];
			cost+=w[j][i];
			for(int k=K;k>=cost;--k){
				f[i][k]=Max(f[i][k],f[i-1][k-cost]+val);
				ans=Max(f[i][k],ans);
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}