#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <random>
#include <cmath>
#include <chrono>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <climits>
#include <stack>
#include <valarray>
#include <random>
#include <bitset>
#include <numeric>
#include <iomanip>
#include <cassert>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(x, b, e) for(int x=(b); x<(e); ++x)
#define trav(a, x) for(auto& a : x)
#define ford(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define all(c) c.begin(),c.end()
#define sz(x) ((int)((x).size()))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
#define mp(x,y) make_pair(x,y)
typedef short int sint;
template<typename T> bool ckmin(T& a, const T& b){return b<a?a=b,1:0;}
template<typename T> bool ckmax(T& a, const T& b){return b>a?a=b,1:0;}


template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(char c) {
  return string(1, c);
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif


// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353; // modint1000000007;
// typedef vector<mint> vmi;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // use rng() to get unsigned int
// mt19937_64 for random long longs

int n, m;

vector<string> move(char dir, vector<string> grid) {
  vector<string> ngrid(n, string(m, '.'));
  int moved = 0;
  if (dir == 'G') {
    rep(col, 0, m) {
      int idx = 0;
      rep(row, 0, n) {
        if (grid[row][col] == '.') continue;
        ngrid[idx++][col] = grid[row][col];
        ++moved;
      }
    }
  } else if (dir == 'D') {
    rep(col, 0, m) {
      int idx = n - 1;
      ford(row, n, 0) {
        if (grid[row][col] == '.') continue;
        ngrid[idx--][col] = grid[row][col];
        ++moved;
      }
    }
  } else if (dir == 'L') {
    rep(row, 0, n) {
      int idx = 0;
      rep(col, 0, m) {
        if (grid[row][col] == '.') continue;
        ngrid[row][idx++] = grid[row][col];
        ++moved;
      }
    }
  } else {
    rep(row, 0, n) {
      int idx = m - 1;
      ford(col, m, 0) {
        if (grid[row][col] == '.') continue;
        ngrid[row][idx--] = grid[row][col];
        ++moved;
      }
    }
  }
  return ngrid;
}

vector<vi> make_move(char dir, vector<vi>& grid) {
  vector<vi> ngrid(n, vi(m));
  if (dir == 'G') {
    rep(col, 0, m) {
      int idx = 0;
      rep(row, 0, n) {
        if (grid[row][col] == 0) continue;
        ngrid[idx++][col] = grid[row][col];
      }
    }
  } else if (dir == 'D') {
    rep(col, 0, m) {
      int idx = n - 1;
      ford(row, n, 0) {
        if (grid[row][col] == 0) continue;
        ngrid[idx--][col] = grid[row][col];
      }
    }
  } else if (dir == 'L') {
    rep(row, 0, n) {
      int idx = 0;
      rep(col, 0, m) {
        if (grid[row][col] == 0) continue;
        ngrid[row][idx++] = grid[row][col];
      }
    }
  } else {
    rep(row, 0, n) {
      int idx = m - 1;
      ford(col, m, 0) {
        if (grid[row][col] == 0) continue;
        ngrid[row][idx--] = grid[row][col];
      }
    }
  }
  return ngrid;
}

void print(const vector<string> &grid) {
  rep(i, 0, n) {
    cout << grid[i] << endl;
  }
}



void solve() {
  cin >> n >> m;
  vector<string> g(n);
  rep(i, 0, n) {
    cin >> g[i];
  }
  int k;
  cin >> k;
  string dirs;
  cin >> dirs;
  int idx = 0;
  int kt;
  if (dirs[0] == 'P' || dirs[0] == 'L') {
    kt = 1;
    while (idx < k && (dirs[idx] == 'P'  || dirs[idx] == 'L')) {
      ++idx;
    }
  } else {
    kt = -1;
    while (idx < k && (dirs[idx] == 'G' || dirs[idx] == 'D')) {
      ++idx;
    }
  }
  g = move(dirs[idx - 1], g);
  if (idx == k) {
    print(g);
    return;
  }
  g = move(dirs[idx], g); // w pozycji start
  ++idx;
  debug("after initial moves", idx);
  // print(g);
  string kier(2, ' ');
  if (kt == 1) {
    kier[0] = dirs[idx - 2];
    kier[1] = dirs[idx - 1];
  } else {
    kier[0] = dirs[idx - 1];
    kier[1] = dirs[idx - 2];
  }
  int st;
  int start;
  debug(kier);
  if (kier == "LG") {
    st = 0;
  } else if (kier == "PG") {
    st = 1;
  } else if (kier == "PD") {
    st = 2;
  } else {
    st = 3;
  }
  start = st;
  string dod = "PDLG";
  string uj  = "DLGP";
  int obroty = 0;
  while (idx < k) {
    char dir = dirs[idx];
    // debug(idx, dir, st);
    if (dod[st] == dir) {
      st = (st + 1) % 4;
      ++obroty;
    } else if (uj[st] == dir) {
      st = (st + 3) % 4;
      --obroty;
    }
    ++idx;
  }
  // now I can start!!!
  debug(obroty);
  string ruchy;
  int moveDir;
  if (obroty >= 0) {
    ruchy = dod;
    moveDir = 1;
  } else {
    obroty *= -1;
    ruchy = uj;
    moveDir = -1;
  }

  int cykle = obroty / 4;
  if (cykle) {
    vector<vi> stan(n, vi(m));
    vector<pii> oryg(n * m + 1);
    int neededPot = 0;
    while ((1 << neededPot) <= cykle) {
      ++neededPot;
    }
    vector<vector<vector<pii>>> wh(neededPot, vector<vector<pii>>(n, vector<pii>(m)));
    int kt = 1;
    rep(i, 0, n) {
      rep(j, 0, m) {
        if (g[i][j] != '.') {
          oryg[kt] = {i, j};
          stan[i][j] = kt++;
        }
      }
    }

    vector<vi> nstan = stan;
    int pos = start;
    rep(i, 0, 4) {
      nstan = make_move(ruchy[pos], nstan);
      pos = (pos + moveDir + 4) % 4;
    }

    rep(i, 0, n) {
      rep(j, 0, m) {
        if (nstan[i][j] != 0) {
          // tu jest
          auto [xo, yo]  = oryg[nstan[i][j]];
          wh[0][xo][yo] = {i, j};
        }
      }
    }

    rep(lvl, 1, neededPot) {
      rep(i, 0, n) {
        rep(j, 0, m) {
          if (nstan[i][j]) {
            auto [ti, tj] = wh[lvl - 1][i][j];
            wh[lvl][i][j] = wh[lvl - 1][ti][tj];
          }
        }
      }
    }

    vector<string> ng(n, string(m, '.'));
    rep(i, 0, n) {
      rep(j, 0, m) {
        if (g[i][j] == '.') continue;
        int tcykle = cykle;
        pii pos(i, j);
        ford(lvl, neededPot, 0) {
          if (tcykle < (1 << lvl)) continue;
          tcykle -= (1 << lvl);
          pos = wh[lvl][pos.st][pos.nd];
        }
        ng[pos.st][pos.nd] = g[i][j];
      }
    }
    g = ng;
  }
  obroty %= 4;

  int pos = start;
  debug("pos", pos);
  rep(i, 0, obroty) {
    // debug(i, pos, ruchy[pos]);
    char ruch = ruchy[pos];
    g = move(ruch, g);
    pos = (pos + moveDir + 4) % 4;
  }
  print(g);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int t;
	// cin >> t;
	t = 1;
	while (t--) {
		solve();
	}
}