#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

string s;
int n, m, k, nr, i00 = 1, j00 = 1, imin, imax, jmin, jmax, imin1, imax1, jmin1, jmax1;

int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> m >> k;
    if (k != 0) cin >> s;
    imin = imax = jmin = jmax = 1;
    for (int i = 0; i < k; i++) {
        if (s[i] == 'U') i00--; else
        if (s[i] == 'D') i00++; else
        if (s[i] == 'L') j00--; else
        if (s[i] == 'R') j00++;
        imin = min(i00, imin);
        imax = max(i00, imax);
        jmin = min(j00, jmin);
        jmax = max(j00, jmax);
    }
    for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
        imin1 = imin + (i - 1);
        imax1 = imax + (i - 1);
        jmin1 = jmin + (j - 1);
        jmax1 = jmax + (j - 1);
        //printf("%d %d %d %d\n", imin1, imax1, jmin1, jmax1);
        if (1 <= imin1 && imin1 <= n &&
            1 <= imax1 && imax1 <= n &&
            1 <= jmin1 && jmin1 <= m &&
            1 <= jmax1 && jmax1 <= m) nr++;
    }
    cout << nr << "\n";
    return 0;
}