#include <cstdio>
#include <iostream>
#include <fstream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <cstring>
#include <string>
#include <ctime>
#include <cassert>
#include <utility>

using namespace std;

#define INF 1000000000

int n, m, k;
string s;

int main() {
//	freopen("date.in", "r", stdin);
//	freopen("date.out","w", stdout);

    cin >> n >> m >> k;
    cin >> s;

    //cout << s << endl;

    int cnt = 0, maxi = -INF, maxj = -INF, mini = INF, minj = INF, initi = 0, initj = 0;
    for(int i = 0; i < k; i++) {
        if(s[i] == 'U') {
            initi--;
        }
        else if(s[i] == 'D') {
            initi++;
        }
        else if(s[i] == 'L') {
            initj--;
        }
        else if(s[i] == 'R') {
            initj++;
        }
        mini = min(mini, initi);
        maxi = max(maxi, initi);
        minj = min(minj, initj);
        maxj = max(maxj, initj);
    }

    //cout << "mini: " << mini << " minj: " << minj << " maxi: " << maxi << " maxj: " <<  maxj << endl;

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if( (i + maxi <= n && i + mini >= 1) && (j + maxj <= m && j + minj >= 1) ) // se afla intre limite acel dreptunghi minim gasit care cuprinde pathul
                cnt++;
        }
    }
    cout << cnt;
    return 0;
}