#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int l, d[100005], x, y, x00, y00, t, lt;
char s[100005];
bool bl[505][505];
bool valid(int a, int b) { return (a >= 1 && a <= x && b >= 1 && b <= y); }
int main() {
  cin >> x >> y >> x00 >> y00;
  scanf("%s", &s);
  l = strlen(s);
  bl[x00][y00] = true;
  for (int i = 0; i < l; i++) {
    if (s[i] == 'U') {
      if (valid(x00 - 1, y00)) {
        x00--;
        lt = i + 1;
        if (!bl[x00][y00]) d[i + 1] = 1;
        bl[x00][y00] = true;
      }
    } else if (s[i] == 'D') {
      if (valid(x00 + 1, y00)) {
        x00++;
        lt = i + 1;
        if (!bl[x00][y00]) d[i + 1] = 1;
        bl[x00][y00] = true;
      }
    } else if (s[i] == 'L') {
      if (valid(x00, y00 - 1)) {
        y00--;
        lt = i + 1;
        if (!bl[x00][y00]) d[i + 1] = 1;
        bl[x00][y00] = true;
      }
    } else {
      if (valid(x00, y00 + 1)) {
        y00++;
        lt = i + 1;
        if (!bl[x00][y00]) d[i + 1] = 1;
        bl[x00][y00] = true;
      }
    }
  }
  for (__typeof(x) i = (1); i <= (x); i++)
    for (__typeof(y) j = (1); j <= (y); j++)
      if (bl[i][j] == false) t++;
  d[lt] += t;
  d[0] = 1;
  for (__typeof(l) i = (0); i <= (l); i++) {
    if (i > 0) printf(" ");
    printf("%d", d[i]);
  }
  return 0;
}
