#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long Ull;
#define MM(a,b) memset(a,b,sizeof(a));
const double eps = 1e-10;
const int  inf =0x7f7f7f7f;
const double pi=acos(-1);
const int maxn=40000;

char s1[20],s2[20];
int x,y,f1[1005],f2[1005];
int main()
{
    int n,m,k,p;
    while(~scanf("%d %d %d",&n,&m,&k)&&(n||m||k))
    {
        scanf("%d",&p);
        MM(f1,0);MM(f2,0);
        int cnt1=0,cnt2=0;
        for(int i=1;i<=p;i++)
        {
            scanf("%s %d %s %d",s1,&x,s2,&y);
            if(s1[0]==‘c‘) {cnt1++;f1[y]++;}
            else {cnt2++;f2[x]++;}
        }
        int res=cnt1*k+n*cnt2;
        for(int i=1;i<=m;i++)
            res-=f1[i]*f2[i];
        printf("%d\n",n*m*k-res);
    }
    return 0;
}