#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define rep1(i,n) for (int i=1; i<(int)(n); ++i)
#define repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(i,n) for (int i=1; i<=(int)(n); ++i)
#define rrep(i,n) for (int i=(int)(n)-1; i>=0; --i)
#define rrep1(i,n) for (int i=(int)(n)-1; i>0; --i)
#define rrepeq(i,n) for (int i=(int)(n); i>=0; --i)
#define rrep1eq(i,n) for (int i=(int)(n); i>0; --i)
#define REP(i,a,b) for (int i=(int)(a); i<=(int)(b); ++i)
#define RREP(i,a,b) for (int i=(int)(a); i>=(int)(b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T> using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD = 1e9+7;
const int MOD2 = 998244353;
// const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"}; // {" ", "\n"}

template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
 
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << " " << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if (vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
 
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << "\n"; return a; }

template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

long long modpow(int a, long long n, int mod = MOD) { long long ret = 1; do { if (n & 1) ret = ret * a % mod; a = 1LL * a * a % mod; } while (n >>= 1); return ret; }

template<typename T> T GCD(T a, T b) { return b ? GCD(b, a%b) : a; }
template<typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }

template<typename T1, typename T2> bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) { return a.second != b.second ? a.second < b.second : a.first < b.first; }
template<typename T1, typename T2> bool CompareByInverse(pair<T1, T2> a, pair<T1, T2> b) { return a.first != b.first ? a.first < b.first : a.second > b.second; }


/* -------- <templates end> -------- */


void solve() {
  int n, l, t; cin >> n >> l >> t;
  vector<pii> arr, rev;
  rep(i,n) {
    int x, w; cin >> x >> w;
    if (w == 1) arr.emplace_back(x, i);
    else rev.emplace_back(x, i);
  }

  if (rev.empty()) {
    t %= l;
    rep(i,n) cout << (arr[i].first + t) % l << '\n';
    return;
  }

  if (arr.empty()) {
    t %= l;
    t = l - t;
    rep(i,n) cout << (rev[i].first + t) % l << '\n';
    return;
  }

  reverse(ALL(arr));

  int idx = arr.begin()->second;

  auto f = [&](int comp) -> ll {
    auto itr = arr.begin();
    auto ritr = upper_bound(ALL(rev), *itr);
    if (ritr == rev.end()) ritr = rev.begin();
    int ridx = ritr - rev.begin();
    ll sum = (ritr->first - itr->first + l) % l;
    int cnt = 0;

    while (sum <= comp) {
      if (++cnt & 1) {
        auto sitr = itr + 1;
        if (sitr == arr.end()) sitr = arr.begin();
        sum += (itr->first - sitr->first + l - 1) % l + 1;
        itr = sitr;
      } else {
        auto sitr = ritr + 1;
        if (sitr == rev.end()) sitr = rev.begin();
        sum += (sitr->first - ritr->first + l - 1) % l + 1;
        ritr = sitr;
      }
    }

    if (cnt & 1) {
      return (rev[(ridx + cnt / 2) % rev.size()].second - idx + n) % n;
    } else {
      return (arr[cnt / 2 % arr.size()].second - idx + n) % n;
    }
  };

  int add = 0;

  if (l <= t) {
    add = t / l * f(2 * l) % n;
    t %= l;
  }

  int dummy = (idx + f(2 * t)) % n;

  vector<pii> pos; pos.reserve(n);
  for (auto &p : arr) pos.emplace_back((p.first + t) % l, p.second + (1<<20));
  for (auto &p : rev) pos.emplace_back((p.first + l - t) % l, p.second);

  sort(ALL(pos));
  
  int v = 0;
  int mask = (1<<20) - 1;
  while ((pos[v].second & mask) != dummy) ++v;

  (v -= idx - add) %= n;
  if (v < 0) v += n;

  REP(i,v,n-1) cout << pos[i].first << '\n';
  rep(i,v) cout << pos[i].first << '\n';
}
/*
void proof() {
  int n, l, t; cin >> n >> l >> t;
  vector<pii> g(n); cin >> g;

  while (t--) {
    vector<pii> sub; sub.reserve(n);
    rep(i,n) {
      if (g[i].second == 1) {
        int j = (i+1) % n;
        if (g[j].second == 2) {
          int d = (g[j].first - g[i].first + l) % l;
          if (d <= 2) {
            if (d == 1) sub.emplace_back(g[i].first, 2);
            else sub.emplace_back((g[i].first + 1) % l, 2);
            continue;
          }
        }
        sub.emplace_back((g[i].first + 1) % l, 1);
      } else {
        int j = (i+n-1) % n;
        if (g[j].second == 1) {
          int d = (g[i].first - g[j].first + l) % l;
          if (d <= 2) {
            if (d == 1) sub.emplace_back(g[i].first, 1);
            else sub.emplace_back((g[i].first + l-1) % l, 1);
            continue;
          }
        }
        sub.emplace_back((g[i].first + l-1) % l, 2);
      }
    }
    g = move(sub);
  }

  rep(i,n) cout << g[i].first << '\n';
}
*/

/* -------- <programs end> -------- */


signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}


Measured memory_bytes: 5092