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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
#include <ios>
#include <iostream>
#include <map>
#include <vector>

int H = 0;
int W = 0;

struct Position {
  Position(char a, char b) {
    if (a == 'G' || a == 'D') {
      x = b;
      y = a;
    } else {
      x = a;
      y = b;
    }
  }

  Position move(int val) {
    if (val == 'G' || val == 'D') {
      return Position(val, x);
    } else {
      return Position(val, y);
    }
  }

  char x;
  char y;

  friend bool operator<(const Position &l, const Position &r) {
    return std::tie(l.x, l.y) < std::tie(r.x, r.y);
  }
};

struct D {
  D(int a, int b) : pos(a, b) {
    pointers['D'] = nullptr;
    pointers['G'] = nullptr;
    pointers['L'] = nullptr;
    pointers['P'] = nullptr;

    pointers[a] = this;
    pointers[b] = this;
  }

  Position pos;
  std::map<char, D *> pointers;
  std::map<std::pair<Position, std::vector<char>>, D *>::iterator iter;
};

char read_char() {
  char c;
  std::cin >> c;
  return c;
}

int read_int() {
  int x;
  std::cin >> x;
  return x;
}

std::vector<char> read_vec(int n) {
  std::vector<char> v(n);
  for (int i = 0; i < n; ++i) {
    std::cin >> v[i];
  }
  return v;
}

void print_vec(const std::vector<char> &v) {
  for (int i = 0; i < H; ++i) {
    for (int j = 0; j < W; ++j) {
      std::cout << v[(i * W) + j];
    }
    std::cout << std::endl;
  }
}

std::vector<char> up(const std::vector<char> &v) {
  std::vector<char> result(H * W, '.');

  for (int i = 0; i < W; ++i) {
    int index = 0;
    for (int j = 0; j < H; ++j) {
      if (v[(j * W) + i] != '.') {
        result[(index * W) + i] = v[(j * W) + i];
        index++;
      }
    }
  }

  return result;
}

std::vector<char> down(const std::vector<char> &v) {
  std::vector<char> result(H * W, '.');

  for (int i = 0; i < W; ++i) {
    int index = H - 1;
    for (int j = H - 1; j >= 0; --j) {
      if (v[(j * W) + i] != '.') {
        result[(index * W) + i] = v[(j * W) + i];
        index--;
      }
    }
  }

  return result;
}

std::vector<char> left(const std::vector<char> &v) {
  std::vector<char> result(H * W, '.');

  for (int i = 0; i < H; ++i) {
    int index = 0;
    for (int j = 0; j < W; ++j) {
      if (v[(i * W) + j] != '.') {
        result[(i * W) + index] = v[(i * W) + j];
        index++;
      }
    }
  }

  return result;
}

std::vector<char> right(const std::vector<char> &v) {
  std::vector<char> result(H * W, '.');

  for (int i = 0; i < H; ++i) {
    int index = W - 1;
    for (int j = W - 1; j >= 0; --j) {
      if (v[(i * W) + j] != '.') {
        result[(i * W) + index] = v[(i * W) + j];
        index--;
      }
    }
  }

  return result;
}

std::vector<char> move(char direction, const std::vector<char> &v) {
  switch (direction) {
    case 'G':
      return up(v);
    case 'D':
      return down(v);
    case 'L':
      return left(v);
    case 'P':
      return right(v);
    default:
      std::cerr << "Invalid direction: " << direction << std::endl;
      exit(1);
  }
}

char neg(char c) {
  switch (c) {
    case 'G':
      return 'D';
    case 'D':
      return 'G';
    case 'L':
      return 'P';
    case 'P':
      return 'L';
    default:
      std::cerr << "Invalid direction: " << c << std::endl;
      exit(1);
  }
}

void process(int count, char prev, char next, const std::vector<char> &v) {
  std::vector<char> nv = move(next, move(prev, v));

  for (int i = 0; i < count; ++i) {
    char next;
    std::cin >> next;

    nv = move(next, nv);
  }

  print_vec(nv);
}

int main() {
  std::ios::sync_with_stdio(false);

  H = read_int();
  W = read_int();

  std::vector<char> V = read_vec(H * W);

  /////////////////////////////////

  // print_vec(V);

  // std::cout << std::endl;
  // print_vec(up(V));

  // std::cout << std::endl;
  // print_vec(down(V));

  // std::cout << std::endl;
  // print_vec(left(V));

  // std::cout << std::endl;
  // print_vec(right(V));

  /////////////////////////////////

  const int N = read_int();

  char prev = read_char();
  for (int i = 0; i < N - 1; ++i) {
    char next;
    std::cin >> next;

    if ((prev == 'G' || prev == 'D') && (next == 'G' || next == 'D')) {
      prev = next;
      continue;
    }

    if ((prev == 'P' || prev == 'L') && (next == 'P' || next == 'L')) {
      prev = next;
      continue;
    }

    process(N - (i + 2), prev, next, std::move(V));
    return 0;
  }

  print_vec(move(prev, V));
  return 0;
}