#include <bits/stdc++.h>

using namespace std;

void Solve() {
  int n, q;
  cin >> n >> q;
  vector<int> P(n);
  for (int i = 0; i < n; ++i) {
    cin >> P[i];
    --P[i];
  }
  vector<tuple<char, int, int>> qs(q);
  for (auto& [c, i, j] : qs) {
    cin >> c;
    if (c == 'E') {
      cin >> i >> j;
      --i, --j;
    }
  }

  int last = -1;
  for (int qi = 0; qi < q; ++qi) {
    if (get<0>(qs[qi]) == 'R') {
      last = qi;
    }
  }

  vector<int> p(n);
  for (int i = 0; i < n; ++i) {
    p[P[i]] = i;
  }

  if (last == -1) {
    for (auto [c, i, j] : qs) {
      swap(p[i], p[j]);
    }
  } else {
    vector<int> f(n);
    for (int i = 0; i < n; ++i) {
      f[i] = n / 2 <= p[i];
    }
    for (int qi = 0; qi < q; ++qi) {
      auto [c, x, y] = qs[qi];
      if (c == 'E') {
        swap(p[x], p[y]);
        swap(f[x], f[y]);
      } else {
        if (qi == last) {
          auto op = p;
          for (int z : {0, 1}) {
            vector<int> v;
            for (int i = 0; i < n; ++i) {
              if (f[i] == z) {
                v.push_back(i);
              }
            }
            if (z == 0) {
              ranges::sort(v, greater{}, [&](int i) { return p[i]; });
            } else {
              ranges::sort(v, {}, [&](int i) { return p[i]; });
            }
            auto it = v.begin();
            for (int i = 0; i < n; ++i) {
              if (f[i] == z) {
                p[i] = op[*it++];
              }
            }
          }
        }
      }
    }
  }

  for (int i = 0; i < n; ++i) {
    P[p[i]] = i;
  }
  for (int i = 0; i < n; ++i) {
    cout << P[i] + 1 << " \n"[i + 1 == n];
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  Solve();
}