1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
//#pragma GCC target("sse,sse2,sse3,mmx,abm,tune=native") // for szkopul and sio only
typedef long long lld;
typedef double lf;
typedef long double llf;
typedef pair<int,int> pii;
typedef pair<lld,lld> pll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
#define For(i,s,a) for(lld i = (lld)s; i < (lld)a; ++i)
#define rpt(s, it) for(auto it = s.begin(); it != s.end(); ++it)
#define brpt(s, it) for(auto it = s.rend(); it != s.rbegin(); --it)
#define pb push_back
#define eb emplace_back
#define ff first
#define dd second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define make_unique(x) (x).erase( unique(all(x)), (x).end())
#define popcnt(x) __builtin_popcount(x)
#define sz size()
#define time_since duration_cast< milliseconds >(system_clock::now().time_since_epoch())
 
template<typename Ta, typename Tb>
ostream & operator <<(ostream & os, pair<Ta, Tb> x){
    return os << x.ff << " " << x.dd;
}

const int N = 5e5 + 1; 
char field[501][501], spare[501][501];
char s[N];

int mask(char z) {
    if (z == 'L' || z == 'P')
        return 2;
    return 4;
}

void push(int n, int m, char z) {    
    For (i, 0, n)
        memset(spare[i], '.', m);
    switch (z) {
        case 'G':
            For (j, 0, m) {
                int ile = 0;
                For (i, 0, n)
                    if (field[i][j] != '.')
                        spare[ile++][j] = field[i][j];
            }
            break;
        case 'D':
            For (j, 0, m) {
                int ile = n - 1;
                for (int i = n - 1; i + 1; --i)
                    if (field[i][j] != '.')
                        spare[ile--][j] = field[i][j];
            }
            break;
        case 'L':
            For (i, 0, n) {
                int ile = 0;
                For (j, 0, m)
                    if (field[i][j] != '.')
                        spare[i][ile++] = field[i][j];
            }
            break;
        case 'P':
            For (i, 0, n) {
                int ile = m - 1;
                for (int j = m - 1; j + 1; --j)
                    if (field[i][j] != '.')
                        spare[i][ile--] = field[i][j];
            }
    }
    For (i, 0, n)
        For (j, 0, m)
            field[i][j] = spare[i][j];
}

int main(void) {
    int n, m;
    scanf("%d%d", &n, &m);
    For (i, 0, n)
        scanf("%s", field[i]);
    int q;
    scanf("%d", &q);
    scanf("%s", s);
    q = unique(s, s + q) - s;
    For (qq, 0, 10) {
        For (i, 0, q - 3) {
            if (s[i] == s[i + 2] && s[i + 1] == s[i + 3])
                s[i + 1] = s[i];
        }
        q = unique(s, s + q) - s;
        For (i, 0, q - 1) {
            if (!(mask(s[i]) ^ mask(s[i + 1])))
                s[i] = s[i + 1];
        }
        q = unique(s, s + q) - s;
    }
    For (i, 0, q) 
        push(n, m, s[i]);
    For (i, 0, n)
        printf("%s\n", field[i]);
}