// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int N, L, T;
int X[MAXN], D[MAXN];

void input()
{
    read(N); read(L); read(T);
    for (int i = 0; i < N; ++i) {
        read(X[i]); read(D[i]);
    }
}

void solve()
{
    int left = 2 * T % L;
    int cntall = 0, cntlast = 0;
    for (int i = 1; i < N; ++i) {
        if (D[i] != D[0]) {
            cntall += 1;
            if (D[0] == 1)
                cntlast += (X[i] - X[0] < left);
            else
                cntlast += (X[0] + L - X[i] <= left);
        }
    }
    int d = ((LL)(2 * T / L) * cntall + cntlast) % N;
    int id = D[0] == 1 ? d : (N - d) % N;
    // printf("d=%d, id=%d\n", d, id);

    vector<Pii> pos;

    int T0 = T % L;
    for (int i = 0; i < N; ++i) {
        int p = (D[i] == 1 ? (X[i] + T0) % L : (X[i] - T0 + L) % L);
        pos.push_back(MP(p, i));
        // printf("pos(%d)=%d\n", i, pos[i].x);
    }
    std::sort(ALL(pos));
    int st = 20000723;
    for (int i = 0; i < N; ++i) {
        if (pos[i].y == 0)
            st = (id - i + N) % N;
    }

    static int ans[MAXN];

    for (int i = 0; i < N; ++i) {
        ans[(st + i) % N] = pos[i].x;
    }

    for (int i = 0; i < N; ++i) {
        printf("%d\n", ans[i]);
    }

    int ed = st = 20000723;     // forever
}

int main()
{
#ifdef __DEBUG
    freopen("C.in", "r", stdin);
    freopen("C.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 莫避春阴上马迟。春来未有不阴时。
//     -- 辛弃疾《鹧鸪天·送欧阳国瑞入吴中》


Measured memory_bytes: 3316