#include<bits/stdc++.h>
#define ii pair<int, int>
#define all(a) a.begin(), a.end()
using namespace std;
const int N = 3e5 + 10;

int n, q;
int a[N], pos[N];
char c[N];
ii s[N];

void init() {
   cin >> n >> q;
   for(int i = 1; i <= n; ++i) cin >> a[i];
   for(int i = 1; i <= q; ++i) {
      cin >> c[i];
      if(c[i] == 'E') cin >> s[i].first >> s[i].second;
   }
}

int main () {
   cin.tie(0) -> sync_with_stdio(0);
   if(fopen("Task.inp", "r")) {
      freopen("Task.inp", "r", stdin);
      freopen("WA.out", "w", stdout);
   }

   init();

   int last = 0;
   for(int i = 1; i <= q; ++i) if(c[i] == 'R') last = i;

   if(last) {
      for(int i = 1; i <= n; ++i) pos[a[i]] = i <= n / 2;

      for(int i = 1; i <= last; ++i) if(c[i] == 'E') {
         int x, y; tie(x, y) = s[i];
         swap(pos[x], pos[y]);
      }

      vector<int> p1, p2;
      for(int i = 1; i <= n; ++i) {
         if(pos[i]) p1.push_back(i);
         else p2.push_back(i);
      }

      sort(all(p1));
      sort(all(p2));

      reverse(all(p1));

      for(int i = 1; i <= n; ++i) {
         if(i <= n / 2) a[i] = p1[i - 1];
         else a[i] = p2[i - n / 2 - 1];
      }
   }

   for(int i = 1; i <= n; ++i) pos[a[i]] = i;

   for(int i = last + 1; i <= q; ++i) {
      int x, y; tie(x, y) = s[i];
      swap(a[pos[x]], a[pos[y]]);
      swap(pos[x], pos[y]);
   }

   for(int i = 1; i <= n; ++i) cout << a[i] << " ";
}