#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 4e5 + 5, M = 405, inf = 0x3f3f3f3f;
int n, m, k, s[M];
int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
int code(int x, int y){return (x - 1) * m + y;}
PII decode(int x){return make_pair((x - 1) / m + 1, (x - 1) % m + 1);}
char ch[N];
vector<bool> a[N];
bool vis[N];
int nxt[N], in[N], h[N];
void topo(){
    _rep(i, 1, n) _rep(j, 1, m) if(a[i][j]) in[nxt[code(i, j)]]++;
    queue<int> q;
    _rep(i, 1, n) _rep(j, 1, m) if(a[i][j] && !in[code(i, j)]) q.push(code(i, j));
    vector<int> p;
    while(q.size()){
        int u = q.front(); q.pop();
        vis[u] = 1, p.pb(u);
        if(!--in[nxt[u]]) q.push(nxt[u]);
    }
    for(auto &i : p) h[nxt[i]] = max(h[nxt[i]], h[i] + 1);
    _rep(i, 1, n) if(!vis[i]) h[i] = inf;
}
int ans[N];
int main(){
    read(n, m, k), scanf("%s", ch + 1);
    _rep(i, 1, k) s[i] = ch[i] == 'U' ? 0 : (ch[i] == 'D' ? 1 : (ch[i] == 'L' ? 2 : 3));
    int tot = 0;
    _rep(i, 1, n){
        scanf("%s", ch + 1), a[i].resize(m + 1);
        _rep(j, 1, m) a[i][j] = ch[j] - '0', tot += a[i][j];
    }
    _rep(i, 1, n) _rep(j, 1, m){
        if(!a[i][j]) continue;
        int x = i, y = j;
        _rep(p, 1, k){
            int nx = x + dx[s[p]], ny = y + dy[s[p]];
            if(nx < 1 || ny < 1 || nx > n || ny > m || !a[nx][ny]) continue;
            x = nx, y = ny;
        }
        nxt[code(i, j)] = code(x, y);
    }
    topo();
    vector<PII> p, vt; vector<int> lst(n * m + 1, 0);
    _rep(i, 1, n) _rep(j, 1, m) if(a[i][j]) p.pb({code(i, j), code(i, j)});
    _rep(o, 1, k){
        vector<int> cur; vector<PII> np;
        for(auto &[i, j] : p){
            PII t = decode(i); int x = t.fi, y = t.se;
            int nx = x + dx[s[o]], ny = y + dy[s[o]];
            if(nx < 1 || ny < 1 || nx > n || ny > m || !a[nx][ny]){nx = x, ny = y;}
            if(lst[code(nx, ny)]){
                int u = j, v = lst[code(nx, ny)];
                vt.pb({min(h[u], h[v]), o});
                if(h[u] > h[v]) lst[code(nx, ny)] = u;
            }else{
                cur.pb(code(nx, ny));
                lst[code(nx, ny)] = j;
            }
        }
        for(auto &i : cur) np.pb({i, lst[i]}), lst[i] = 0;
        swap(p, np);
    }
    vector<int> cur;
    for(auto &i : vt){
        _rep(o, 0, i.fi) cur.pb(o * k + i.se);
    }
    sort(cur.begin(), cur.end());
    vector<int> ans(n * m + 1, -1);
    int res = tot, len = cur.size(); _rep(i, tot, n * m) ans[i] = 0;
    _rep(i, 0, len - 1){
        int j = i;
        while(j < len - 1 && cur[j + 1] == cur[i]) j++;
        _rep(k, i, j) ans[--res] = cur[i];
        i = j;
    }
    _rep(i, 1, n * m) writeln(ans[i]);
    return 0;
}