#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n, m, q;
	cin >> n >> m >> q;
	VI sick(m);
	FOR (i, 0, m)
	{
		cin >> sick[i];
		sick[i]--;
	}
	
	VI pref(n + 1);
	FOR (i, 0, m)
		pref[sick[i] + 1] = 1;
	FOR (i, 0, n)
		pref[i + 1] += pref[i];
	
	vector<pair<int, char>> v(q);
	FOR (i, 0, q)
	{
		cin >> v[i].F >> v[i].S;
		v[i].F--;
	}
	VI cntL(n), cntR(n);
	RFOR (i, q, 0)
	{
		if (v[i].S == 'R')
			cntL[v[i].F] = 1 + cntL[(v[i].F + n - 1) % n];
		else
			cntR[v[i].F] = 1 + cntR[(v[i].F + 1) % n];
	}
	VI ans;
	FOR (i, 0, n)
	{
		//cerr << i << ' ' << cntL[i] << ' ' << cntR[i] << '\n';
		if (1 + cntL[i] + cntR[i] >= n)
		{
			ans.PB(i + 1);
			continue;
		}
		int R = (i + cntR[i]) % n;
		int L = (i - cntL[i] + n) % n;
		int l = (R + 1) % n, r = (L + n - 1) % n;
		
		//cerr << i << ' ' << cntL[i] << ' ' << cntR[i] << ' ' << L << ' ' << R << ' ' << l << ' ' << r << '\n';
		
		if (l <= r)
		{
			if (pref[r + 1] - pref[l] == 0)
				ans.PB(i + 1);
		}
		else
		{
			if (pref[n] - pref[l] + pref[r + 1] == 0)
				ans.PB(i + 1);
		}
	}
	FOR (i, 0, SZ(ans))
	{
		if (i)
			cout << ' ';
		cout << ans[i];
	}
	cout << '\n';
	
	return 0;
}