#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 10001
#define MOD 1000000007

using namespace std;
int n,m,k;
int x,y,r,ans=0;
string s;

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