// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
int n, m, k, mv[200005][205], in[200005], p[200005], q[200005], vis[200005];
long long ANS[200005];
char a[200005];
std::string s;
std::vector<int> g;
int move(int pos, char c)
{
    int x = pos / m, y = pos % m;
    switch (c)
    {
    case 'U':
        --x;
        break;
    case 'D':
        ++x;
        break;
    case 'L':
        --y;
        break;
    case 'R':
        ++y;
        break;
    }
    return x >= 0 && x < n && y >= 0 && y < m && a[x * m + y] == '1' ? x * m + y : pos;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> m >> k >> s;
    for (int i = 0; i != n * m; ++i)
        std::cin >> a[i];
    for (int i = 0; i != n * m; ++i)
        if (a[i] == '1')
        {
            mv[i][0] = i;
            for (int j = 0; j != k; ++j)
                mv[i][j + 1] = move(mv[i][j], s[j]);
            ++in[mv[i][k]];
        }
    std::queue<int> que;
    for (int i = 0; i != n * m; ++i)
        if (a[i] == '1' && !in[i])
            que.push(i);
    while (!que.empty())
    {
        int now = que.front();
        que.pop();
        g.push_back(now);
        if (!--in[mv[now][k]])
            que.push(mv[now][k]);
    }
    for (auto i : g)
        p[mv[i][k]] = p[i] + 1;
    for (int i = 0; i != n * m; ++i)
        if (in[i])
            p[i] = n * m + 1, g.push_back(i);
    std::reverse(g.begin(), g.end());
    for (int i = 1; i <= k; ++i)
        for (auto j : g)
        {
            if (!q[j] && vis[mv[j][i]] == i)
                q[j] = i;
            vis[mv[j][i]] = i;
        }
    std::vector<long long> ans;
    for (auto i : g)
        if (q[i])
            for (int j = 0; j <= p[i]; ++j)
                ans.push_back(1ll * j * k + q[i]);
    std::sort(ans.begin(), ans.end());
    std::fill(ANS, ANS + g.size() - ans.size(), -1);
    for (std::size_t i = 0; i != ans.size(); ++i)
        ANS[g.size() - i - 1] = ans[i];
    for (int i = 1; i <= n * m; ++i)
        std::cout << ANS[i] << std::endl;
    return 0;
}