#include <bits/stdc++.h>

using namespace std;

string simplify(string v) {
  string w = "";

  while (v != w) {
    char prev = v[0];

    w = "";

    for (int i = 1; i < v.size(); i++) {
      char cur = v[i];

      if (cur == 'G' || cur == 'D') {
        if (prev != 'G' && prev != 'D') {
          w += prev;
        }
      } else {
        if (prev != 'L' && prev != 'P') {
          w += prev;
        }
      }

      prev = cur;
    }

    w += v[v.size() - 1];

    v = "";

    char prevHor = '#';
    char prevVer = '#';

    for (char c : w) {
      if (c == 'G' || c == 'D') {
        if (c != prevVer) {
          v += c;
        }
        prevVer = c;
      } else {
        if (c != prevHor) {
          v += c;
        }
        prevHor = c;
      }
    }
  }

  return v;
}

struct Board {
  int n, m;
  vector<vector<char>> board;

  void input() {
    cin >> n >> m;

    for (int i = 0; i < n; i++) {
      vector<char> row;
      for (int j = 0; j < m; j++) {
        char c;
        cin >> c;
        row.push_back(c);
      }
      board.push_back(row);
    }
  }

  string to_string() {
    string s = "";
    for (auto row : board) {
      for (auto c : row)
        s += c;
      s += '\n';
    }
    return s;
  }

  void output() { cout << to_string(); }

  void L() {
    for (int i = 0; i < n; i++) {
      vector<char> row(m, '.');
      int id = 0;
      for (int j = 0; j < m; j++) {
        char cur = board[i][j];
        if (cur != '.') {
          row[id++] = cur;
        }
      }
      board[i] = row;
    }
  }

  void P() {
    for (int i = 0; i < n; i++) {
      vector<char> row(m, '.');
      int id = m - 1;
      for (int j = m - 1; j >= 0; j--) {
        char cur = board[i][j];
        if (cur != '.') {
          row[id--] = cur;
        }
      }
      board[i] = row;
    }
  }

  void G() {
    vector<vector<char>> rotBoard;
    for (int j = 0; j < m; j++) {
      vector<char> col(n, '.');
      int id = 0;
      for (int i = 0; i < n; i++) {
        char cur = board[i][j];
        if (cur != '.') {
          col[id++] = cur;
        }
      }
      rotBoard.push_back(col);
    }

    for (int i = 0; i < n; i++) {
      vector<char> row;
      for (int j = 0; j < m; j++) {
        row.push_back(rotBoard[j][i]);
      }
      board[i] = row;
    }
  }

  void D() {
    vector<vector<char>> rotBoard;
    for (int j = 0; j < m; j++) {
      vector<char> col(n, '.');
      int id = n - 1;
      for (int i = n - 1; i >= 0; i--) {
        char cur = board[i][j];
        if (cur != '.') {
          col[id--] = cur;
        }
      }
      rotBoard.push_back(col);
    }

    for (int i = 0; i < n; i++) {
      vector<char> row;
      for (int j = 0; j < m; j++) {
        row.push_back(rotBoard[j][i]);
      }
      board[i] = row;
    }
  }
};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  Board board;

  board.input();

  int k;
  cin >> k;

  string s;
  cin >> s;

  string v = simplify(s);

  k = v.size();

  unordered_set<string> history;
  vector<string> memory;

  for (int i = 0; i < k; i++) {
    char c = v[i];
    if (c == 'G') {
      board.G();
    } else if (c == 'D') {
      board.D();
    } else if (c == 'L') {
      board.L();
    } else if (c == 'P') {
      board.P();
    }

    if (i > 0) {
      string m = board.to_string();
      if (history.find(m) != history.end()) {
        int t = (k - 1) % (i - 1);
        if (t == 0)
          cout << memory[i - 2];
        else
          cout << memory[t - 1];
        return 0;
      } else {
        history.insert(m);
        memory.push_back(m);
      }
    }
  }

  board.output();

  return 0;
}