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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
#define szybkosc ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0);
#define endl '\n'

char tab[502][502];

stack<char>pm;

void ruch(char gdzie, int n, int m) {

    int rozmiar;

    switch (gdzie) {

    case 'G':

        for (int i = 1; i <= m; i++) {

            for (int j = n; j >= 1; j--) {

                if (tab[j][i] != '.') {
                    pm.push(tab[j][i]);
                    tab[j][i] = '.';
                }

            }

            int rozmiar = pm.size();

            for (int j = 1; j <= rozmiar; j++) {
                tab[j][i] = pm.top();
                pm.pop();
            }

        }
        break;
    case 'D':
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (tab[j][i] != '.') {
                    pm.push(tab[j][i]);
                    tab[j][i] = '.';
                }
            }
            int rozmiar = pm.size();
            for (int j = n; j > n-rozmiar; j--) {
                tab[j][i] = pm.top();
                pm.pop();
            }
        }
        break;
    case 'L':
        for (int i = 1; i <= n; i++) {
            for (int j = m; j >= 1; j--) {

                if (tab[i][j] != '.') {
                    pm.push(tab[i][j]);
                    tab[i][j] = '.';
                }
            }
            int rozmiar = pm.size();
            for (int j = 1; j <= rozmiar; j++) {
                tab[i][j] = pm.top();
                pm.pop();
            }
        }
        break;
    case 'P':
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (tab[i][j] != '.') {
                    pm.push(tab[i][j]);
                    tab[i][j] = '.';
                }

            }
            int rozmiar = pm.size();
            for (int j = m; j > m - rozmiar; j--) {
                tab[i][j] = pm.top();
                pm.pop();
            }
        }
        break;
    }
    return;

}
int sprawdzenie(string s, int i) {
    int pocz = i%2;
    if (s[i] == 'L') {
        while (s[i + 1] == 'P' or s[i+1]=='L' and i + 1 < s.size()) {
            i++;
        }
        return i;
    }
    if (s[i] == 'P') {
        while (s[i + 1] == 'P' or s[i + 1] == 'L' and i + 1 < s.size()) {
            i++;
        }
        return i;
    }
    if (s[i] == 'G') {
        while (s[i + 1] == 'G' or s[i + 1] == 'D' and i + 1 < s.size()) {
            i++;
        }
        return i;
    }
    if (s[i] == 'D') {
        while (s[i + 1] == 'G' or s[i + 1] == 'D' and i + 1 < s.size()) {
            i++;
        }
        return i;
    }
}
void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> tab[i][j];
    int q;  cin >> q;
    string s; cin >> s;
    for (int i = 0; i < s.size(); i++) {
        i=sprawdzenie(s, i);
        ruch(s[i], n, m);
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) cout << tab[i][j];
        cout << endl;
    }
    return;
}

int main()
{
    szybkosc
    solve();
    return 0;
}