#include
#include
#include
#include
#include
#include
#include
#include
#include
#define pi 3.1415926535897932
#define abs(x) ((x)>0?(x):-(x))
#define sqr(x) ((x)*(x))
#define fill(m,v) memset(m,v,sizeof(m))
#define SS(x) scanf("%d",&x)
#define inf 0x7fffffff
#define hinf 0x3f3f3f3f
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(v) ((int)v.size())
#define y0 stupid_cmath
#define y1 very_stupid_cmath
#define ll __int64
#define ull unsigned __int64
#define pb push_back
#define mp make_pair
#define rep(i,m) for(int i=0;i<(int)(m);i++)
#define rep2(i,n,m) for(int i=n;i<(int)(m);i++)
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define FF(i,a) for(int i = 0; i < (a); i++ )
#define FFD(i,a) for(int i = (a)-1; i >= 0; i--)
#define CC(m,what) memset(m,what,sizeof(m))
#define SZ(a) ((int)a.size())
#define PP(n,m,a) puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
int dx[] = {-1, 0, 1, 0};//up Right down Left
int dy[] = {0, 1, 0, -1};
//#define For(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();++it)
using namespace std;
#define M 400100
template
template
int gap[M],dis[M],pre[M],cur[M];
int NE;
int head[M];
struct Node{
int c,pos,next;
}E[999999];
int sap(int s,int t, int NV) {
memset(dis,0,sizeof(int)*(NV+1));
memset(gap,0,sizeof(int)*(NV+1));
FF(i,NV) cur[i] = head[i];
int u = pre[s] = s,maxflow = 0,aug = -1;
gap[0] = NV;
while(dis[s] < NV) {
loop: for(int &i = cur[u]; i != -1; i = E[i].next) {
int v = E[i].pos;
if(E[i].c && dis[u] == dis[v] + 1) {
checkmin(aug,E[i].c);
pre[v] = u;
u = v;
if(v == t) {
maxflow += aug;
for(u = pre[u];v != s;v = u,u = pre[u]) {
E[cur[u]].c -= aug;
E[cur[u]^1].c += aug;
}
aug = -1;
}
goto loop;
}
}
int mindis = NV;
for(int i = head[u]; i != -1 ; i = E[i].next) {
int v = E[i].pos;
if(E[i].c && mindis > dis[v]) {
cur[u] = i;
mindis = dis[v];
}
}
if( (--gap[dis[u]]) == 0) break;
gap[ dis[u] = mindis+1 ] ++;
u = pre[u];
}
return maxflow;
}
void addEdge(int u,int v,int c,int cc = 0) {
E[NE].c = c; E[NE].pos = v;
E[NE].next = head[u]; head[u] = NE++;
E[NE].c = cc; E[NE].pos = u;
E[NE].next = head[v]; head[v] = NE++;
}
int main()
{
int n,f,d;
int i,j;
int x,y,c;
while(scanf("%d %d %d",&n,&f,&d) != EOF)
{
for(i = 0;i <= 1+f+n+n+d+1; i++) head[i] = -1;
NE = 0;
for(i = 1; i <= f; i++)//源点与食物相连
{
scanf("%d",&c);
addEdge(1,1+i,c);
}
for(i = 1; i <= d; i++)//饮料与汇点相连
{
scanf("%d",&c);
addEdge(1+f+n+n+i,1+f+n+n+d+1,c);
}
char str[205];
int flag[205];
int ans = 0;
for(i = 1; i <= n; i++)
{
int cou = 0;
flag[i] = 0;
scanf("%s",str);
addEdge(1+f+i,1+f+n+i,1);//人和自己的另一面相连
for(j = 0; j < f; j++)//食物与人相连
{
if('Y' == str[j])
addEdge(1+j+1,1+f+i,1);
else
cou++;
}
if(cou == f)
flag[i] = 1;
}
for(i = 1; i <= n; i++)//人的另一面与饮料相连
{
int cou = 0;
scanf("%s",str);
for(j = 0; j < d; j++)
{
if('Y' == str[j])
addEdge(1+f+n+i,1+f+n+n+j+1,1);
else
cou++;
}
if(cou == d && flag[i] == 1)
ans++;
}
printf("%d\n",ans+sap(1,1+f+n+n+d+1,1+f+n+n+d+1));
}
return 0;
}