#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return a > val ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
const int maxn = 300010;
int n, m;
long long t;
int ans[maxn];
long long fixmod(long long r, long long p) { return ((r - 1) % p + p) % p + 1; }
void solve() {
  cin >> n >> m >> t;
  long long tot = 0;
  vector<pair<long long, long long> > pos;
  vector<long long> fpos;
  for (int i = (0); i < (n); i++) {
    int x;
    string dir;
    cin >> x >> dir;
    pos.push_back(make_pair(x, i));
    fpos.push_back(fixmod(x + (dir == "R" ? 1 : -1) * t, m));
    tot = fixmod(tot + (dir == "R" ? 1 : -1) * t, (long long)n * m);
    tot = fixmod(tot - fpos.back() + x, (long long)n * m);
  }
  sort((pos).begin(), (pos).end());
  sort((fpos).begin(), (fpos).end());
  assert(tot % m == 0);
  int shift = (tot / m) % n;
  for (int i = (0); i < (n); i++) ans[pos[i].second] = fpos[(i + shift) % n];
  for (int i = (0); i < (n); i++) cout << ans[i] << " ";
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
