#include <iostream>
#include <fstream>
#include <algorithm>
#include <math.h>
#include <string>
#include <vector>
#include <stdio.h>
#include <queue>

#define LL long long
#define pb push_back
#define lm 1000001
#define MOD 1000000007

using namespace std;
int n,m,k;
int x,y,ans=0,mx,my,mix,miy;
string s;

int main()
{
    //freopen("data.in","r",stdin);
    cin>>n>>m>>k;
    cin>>s;
    for(int i=0; i<k; i++)
    {
        if(s[i]=='L')
        {
            y-=1;
            miy=min(miy,y);
        }
        else if(s[i]=='R')
        {
            y+=1;
            my=max(my,y);
        }
        else if(s[i]=='U')
        {
            x-=1;
            mix=min(mix,x);
        }
        else if(s[i]=='D')
        {
            x+=1;
            mx=max(mx,x);
        }
    }
    for (int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            x=i;
            y=j;
            if(abs(mix)<x && abs(miy)<y && mx<=n-x && my<=m-y)
                ans++;
        }
    }
    cout<<ans;
    return 0;
}