#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mininf = 1e9 + 7;
#define int long long
#define pb emplace_back
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
#define put() putchar(' ')
#define endl puts("")
const int MAX = 5e5 + 10;

int a[MAX];
int b[MAX];
bool id[MAX];
int pos[MAX];

void solve(){
	int n = read(), q = read();
	for(int i = 1; i <= n; i++){
		a[i] = read();
	}
	for(int i = 1; i <= n / 2; i++){
		id[a[i]] = 0;
	}
	for(int i = n / 2 + 1; i <= n; i++){
		id[a[i]] = 1;
	}
	bool fl = 0;
	bool fl2 = 0;
	vector <pair<int,int>> prepos;
	while(q--){
		char ch = getchar();
		while(ch != 'R' and ch != 'E')	ch = getchar();
		if(ch == 'E'){
			// fl = 0;
			int u = read(), v = read();
			prepos.pb(make_pair(u, v));
		}else{
			fl2 = 1;
			// if(fl)	continue;
			// else{
				// fl = 1;
			for(int i = 0; i < prepos.size(); i++){
				int u = prepos[i].first, v = prepos[i].second;
				if(id[u] == id[v]){
					continue;
				}
				id[u] ^= 1;
				id[v] ^= 1;	
			}
			prepos.clear();
			// }
		}
	}
	if(fl2){
		int L = n / 2, R = n / 2 + 1;
		for(int i = 1; i <= n; i++){
			if(!id[i]){
				b[L] = i;
				pos[i] = L;
				L--;
			}else{
				b[R] = i;
				pos[i] = R;
				R++;
			}
		}
		for(int i = 0; i < prepos.size(); i++){
			int u = prepos[i].first, v = prepos[i].second;
			swap(b[pos[u]], b[pos[v]]);
			swap(pos[u], pos[v]);
		}
		for(int i = 1; i <= n; i++){
			write(b[i]), put();
		}endl;
	}else{
		for(int i = 1; i <= n; i++){
			pos[a[i]] = i;
		}
		for(int i = 0; i < prepos.size(); i++){
			int u = prepos[i].first, v = prepos[i].second;
			swap(a[pos[u]], a[pos[v]]);
			swap(pos[u], pos[v]);
		}
		for(int i = 1; i <= n; i++){
			write(a[i]), put();
		}endl;
	}
}

signed main(){
	int t = 1;
	while(t--)	solve();
	return 0;
}