#include <iostream>
#include <algorithm>

using namespace std;

char sir[1200000];

int main()
{
    int n,m,k,i;
    cin>>n>>m>>k;

    for(i=0;i<k;i++)
        cin>>sir[i];

    int min_x=1,min_y=1,max_x=n,max_y=m;
    int x=0,y=0;
    for(i=0;i<k;i++)
    {
        if(sir[i]=='U')
            x--;
        else if(sir[i]=='D')
            x++;
        else if(sir[i]=='L')
            y--;
        else
            y++;
        min_x=max(min_x,1-x);
        min_y=max(min_y,1-y);
        max_x=min(max_x,n-x);
        max_y=min(max_y,m-y);
    }

    if(min_x<=max_x && min_y<=max_y)
        cout<<(max_x-min_x+1)*(max_y-min_y+1)<<'\n';
    else
        cout<<"0\n";

    return 0;
}