#include <bits/stdc++.h>
using namespace std;

using ll  = long long;
using pii = pair<int, int>;

#define fi       first
#define se       second
#define All(x)   x.begin(), x.end()
#define debug(x) cout << #x << " = " << (x) << '\n';

const int iINF = 1'000'000'000;
const ll INF   = 1'000'000'000'000'000'000;

using Segment   = pii;

const int maxN  = 100'023;

int N, M, Q, pf[maxN];
vector<Segment> seg[maxN];
vector<pii> que;
bool ans[maxN];

char buf;

Segment unionSeg(Segment &a, Segment &b) {
    return {min(a.fi, b.fi), max(a.se, b.se)};
}

vector<Segment> mergeSeg(vector<Segment> &a, vector<Segment> &b) {
    vector<Segment> c;
    for (auto i : a) c.push_back(i);
    for (auto i : b) c.push_back(i);
    sort(All(c));

    vector<Segment> ret;
    for (auto s : c) {
        while (!ret.empty() && (ret.back().se >= s.fi)) {
            s = unionSeg(s, ret.back());
            ret.pop_back();
        }
        ret.push_back(s);
    }

    return ret;
}

int querySeg(vector<Segment> &v) {
    int ret = 0;
    for (auto [l, r] : v) ret += pf[r] - pf[l-1];
    return ret;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    cin >> N >> M >> Q;
    for (int x, i = 1; i <= M; i++) {
        cin >> x;
        pf[x] = 1;
    }
    for (int x, d, i = 1; i <= Q; i++) {
        cin >> x >> buf;
        if (buf == 'L') d = 1;
        else d = -1;
        que.push_back({x, d});
    }

    for (int i = 1; i <= N; i++) pf[i] += pf[i-1];
    for (int i = 1; i <= N; i++) {
        seg[i].push_back({i, i});
        if (querySeg(seg[i]) == M) ans[i] = true;
    }

    reverse(All(que));
    for (auto &[x, d] : que) {
        int y = x + d;
        if (y == 0) y = N;
        if (y == N+1) y = 1;

        seg[x] = mergeSeg(seg[x], seg[y]);
        if (querySeg(seg[x]) == M) ans[x] = true;
    }

    for (int i = 1; i <= N; i++) {
        if (ans[i]) cout << i << " ";
    }
    cout << '\n';
}