Problem:


Score : 700 points

Problem Statement

There is a circle with a circumference of L.
Each point on the circumference has a coordinate value, which represents the arc length from a certain reference point clockwise to the point.
On this circumference, there are N ants.
These ants are numbered 1 through N in order of increasing coordinate, and ant i is at coordinate X_i.

The N ants have just started walking.
For each ant i, you are given the initial direction W_i. Ant i is initially walking clockwise if W_i is 1; counterclockwise if W_i is 2.
Every ant walks at a constant speed of 1 per second.
Sometimes, two ants bump into each other.
Each of these two ants will then turn around and start walking in the opposite direction.

For each ant, find its position after T seconds.

Constraints

All input values are integers.

1 \leq N \leq 10^5

1 \leq L \leq 10^9

1 \leq T \leq 10^9

0 \leq X_1 < X_2 < ... < X_N \leq L - 1

1 \leq W_i \leq 2

Input

The input is given from Standard Input in the following format:

N L T
X_1 W_1
X_2 W_2
:
X_N W_N

Output

Print N lines.
The i-th line should contain the coordinate of ant i after T seconds. Here, each coordinate must be between 0 and L-1, inclusive.

Sample Input 1

3 8 3
0 1
3 2
6 1

Sample Output 1

1
3
0

1.5 seconds after the ants start walking, ant 1 and 2 bump into each other at coordinate 1.5.
1 second after that, ant 1 and 3 bump into each other at coordinate 0.5.
0.5 seconds after that, that is, 3 seconds after the ants start walking, ants 1, 2 and 3 are at coordinates 1, 3 and 0, respectively.

Sample Input 2

4 20 9
7 2
9 1
12 1
18 1

Sample Output 2

7
18
18
1



Sample input:
3 8 3
0 1
3 2
6 1


Sample output:
1
3
0

Submission status: Wrong Answer

Solution code:
def examA():
    N = I()
    A = LI()
    ans = 1
    flag = None
    for i in range(N-1):
        cur = A[i+1] - A[i]
        if not flag:
            if cur<0:
                flag = "d"
            elif cur>0:
                flag = "u"
        else:
            if cur<0 and flag=="u":
                flag = None
                ans += 1
            elif cur>0 and flag=="d":
                flag = None
                ans += 1
    print(ans)
    return

def examB():
    def bfs(n,V):
        W = [inf] * n
        W[0] = 0
        que = deque()
        que.append(0)
        while (que):
            now = que.popleft()
            nowW = W[now]
            if nowW==0:
                judge = 0
            elif nowW>0:
                judge = 1
            else:
                judge = -1
            if judge<0:
                cur = -1
            else:
                cur = 1

            for ne in V[now]:
                #print(now,ne)
                if cur+1<judge:
                    break
                if W[ne]!=inf:
                    continue
                W[ne] = nowW + cur
                que.append(ne)
                cur -= 2
        return W
    N, M = LI()
    V = [[]for _ in range(N)]
    for _ in range(M):
        a, b = LI()
        a -= 1; b -= 1
        V[a].append(b)
        V[b].append(a)

    L = bfs(N,V)
    D = defaultdict(int)
    minA = 0; maxA = 0
    for i,a in enumerate(L,start=1):
        if a!=inf:
            D[a] = i
            if a<minA:
                minA = a
            if a>maxA:
                maxA = a
    ans = []
    for i in range(minA,maxA+1):
        ans.append(D[i])
    print(len(ans))
    print(" ".join(map(str,ans)))
    return

def examC():
    N, L, T = LI()
    X = [[]for _ in range(N)]
    for i in range(N):
        cur = LI()
        cur.append(i)
        X[i] = cur
    #print(X)
    X.sort()
    ans_num = defaultdict(int)
    for j,[x,w,i] in enumerate(X):
        ans_num[j] = i

    X_R = []
    X_L = []
    flag_R = False
    for x,w,i in X:
        if w==1:
            if i==0:
                flag_R = True
            X_R.append([x,i])
        else:
            X_L.append([x,i])
    V = []
    for i in range(N):
        now = T if X[i][1]==1 else -T
        cur = [(X[i][0] + now + L*100000000)%L,X[i][2]]
        V.append(cur)
    #print(V)
    change = 0
    if flag_R:
        stand = X_R[0][0]
    else:
        stand = X_L[0][0]
    for x,i in X_L if flag_R else X_R:
        cur = (2*T)//L
        if flag_R:
            if (x - stand) > 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) < 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        else:
            if (x - stand) < 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) > 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        #print(cur,x,i)
        change += cur
    to = change % N
    if not flag_R:
        to = to*(-1)+N
    #print(change,to)


    ans = [0]*N
    for i in range(N):
        #print(V[i])
        cur = V[i+to-N][1]
        ans[cur] = V[i][0]
    for v in ans:
        print(v)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examC()

"""

"""

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys

N, L, T = map(int, input().split())
I = np.array(sys.stdin.read().split(), np.int64)
X = I[::2]
W = I[1::2]
W[np.where(W==2)] = -1

P = (X + T*W) % L

#1の蟻の場所を調べるために、なんか1がすれ違うかを考える
#1の蟻と反対向きに動く蟻は停止させて、1の蟻の速度を2にして考える。
cond = 1
if W[0] == -1:
	W *= -1
	X = (L-X)%L
	cond = 0

lap, over = divmod(2*T,L)
anti_aunt_ind = np.where(W == -1)
anti_aunt = X[anti_aunt_ind]
encount = lap*len(anti_aunt) + np.searchsorted(anti_aunt, over, side = 'left')
if cond:
	no = 1 + (encount%N)
else:
	no = (N - (encount-1))%N

ans = np.concatenate([P[N-no+1:],P[:N-no+1]])

for a in ans:
	print(a)

Submission status: Wrong Answer

Solution code:
def examA():
    N = I()
    A = LI()
    ans = 1
    flag = None
    for i in range(N-1):
        cur = A[i+1] - A[i]
        if not flag:
            if cur<0:
                flag = "d"
            elif cur>0:
                flag = "u"
        else:
            if cur<0 and flag=="u":
                flag = None
                ans += 1
            elif cur>0 and flag=="d":
                flag = None
                ans += 1
    print(ans)
    return

def examB():
    def bfs(n,V):
        W = [inf] * n
        W[0] = 0
        que = deque()
        que.append(0)
        while (que):
            now = que.popleft()
            nowW = W[now]
            if nowW==0:
                judge = 0
            elif nowW>0:
                judge = 1
            else:
                judge = -1
            if judge<0:
                cur = -1
            else:
                cur = 1

            for ne in V[now]:
                #print(now,ne)
                if cur+1<judge:
                    break
                if W[ne]!=inf:
                    continue
                W[ne] = nowW + cur
                que.append(ne)
                cur -= 2
        return W
    N, M = LI()
    V = [[]for _ in range(N)]
    for _ in range(M):
        a, b = LI()
        a -= 1; b -= 1
        V[a].append(b)
        V[b].append(a)

    L = bfs(N,V)
    D = defaultdict(int)
    minA = 0; maxA = 0
    for i,a in enumerate(L,start=1):
        if a!=inf:
            D[a] = i
            if a<minA:
                minA = a
            if a>maxA:
                maxA = a
    ans = []
    for i in range(minA,maxA+1):
        ans.append(D[i])
    print(len(ans))
    print(" ".join(map(str,ans)))
    return

def examC():
    N, L, T = LI()
    X = [[]for _ in range(N)]
    for i in range(N):
        cur = LI()
        cur.append(i)
        X[i] = cur
    #print(X)
    X.sort()
    ans_num = defaultdict(int)
    for j,[x,w,i] in enumerate(X):
        ans_num[j] = i

    X_R = []
    X_L = []
    flag_R = False
    for x,w,i in X:
        if w==1:
            if i==0:
                flag_R = True
            X_R.append([x,i])
        else:
            X_L.append([x,i])
    V = []
    for i in range(N):
        now = T if X[i][1]==1 else -T
        cur = (X[i][0] + now + L*1000000)%L
        V.append(cur)
    change = 0
    if flag_R:
        stand = X_R[0][0]
    else:
        stand = X_L[0][0]
    for x,i in X_L if flag_R else X_R:
        cur = (2*T)//L
        if flag_R:
            if (x - stand) > 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) < 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        else:
            if (x - stand) < 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) > 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        #print(cur,x,i)
        change += cur
    to = change % N
    #print(change,to)

    import numpy as np
    if flag_R:
        V = np.roll(V, to)
    else:
        V = np.roll(V, -to)

    ans = [0]*N
    for i in range(N):
        ans[ans_num[i]] = V[i]
    for v in ans:
        print(v)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examC()

"""

"""

Submission status: Wrong Answer

Solution code:
def examA():
    N = I()
    A = LI()
    ans = 1
    flag = None
    for i in range(N-1):
        cur = A[i+1] - A[i]
        if not flag:
            if cur<0:
                flag = "d"
            elif cur>0:
                flag = "u"
        else:
            if cur<0 and flag=="u":
                flag = None
                ans += 1
            elif cur>0 and flag=="d":
                flag = None
                ans += 1
    print(ans)
    return

def examB():
    def bfs(n,V):
        W = [inf] * n
        W[0] = 0
        que = deque()
        que.append(0)
        while (que):
            now = que.popleft()
            nowW = W[now]
            if nowW==0:
                judge = 0
            elif nowW>0:
                judge = 1
            else:
                judge = -1
            if judge<0:
                cur = -1
            else:
                cur = 1

            for ne in V[now]:
                #print(now,ne)
                if cur+1<judge:
                    break
                if W[ne]!=inf:
                    continue
                W[ne] = nowW + cur
                que.append(ne)
                cur -= 2
        return W
    N, M = LI()
    V = [[]for _ in range(N)]
    for _ in range(M):
        a, b = LI()
        a -= 1; b -= 1
        V[a].append(b)
        V[b].append(a)

    L = bfs(N,V)
    D = defaultdict(int)
    minA = 0; maxA = 0
    for i,a in enumerate(L,start=1):
        if a!=inf:
            D[a] = i
            if a<minA:
                minA = a
            if a>maxA:
                maxA = a
    ans = []
    for i in range(minA,maxA+1):
        ans.append(D[i])
    print(len(ans))
    print(" ".join(map(str,ans)))
    return

def examC():
    N, L, T = LI()
    X = [[]for _ in range(N)]
    for i in range(N):
        cur = LI()
        cur.append(i)
        X[i] = cur
    #print(X)
    X.sort()
    ans_num = defaultdict(int)
    for j,[x,w,i] in enumerate(X):
        ans_num[j] = i

    X_R = []
    X_L = []
    flag_R = False
    for x,w,i in X:
        if w==1:
            if i==0:
                flag_R = True
            X_R.append([x,i])
        else:
            X_L.append([x,i])
    V = []
    for i in range(N):
        now = T if X[i][1]==1 else -T
        cur = (X[i][0] + now)%L
        cur = (cur+L)%L
        V.append(cur)
    change = 0
    if flag_R:
        stand = X_R[0][0]
    else:
        stand = X_L[0][0]
    for x,i in X_L if flag_R else X_R:
        cur = (2*T)//L
        if flag_R:
            if (x - stand) > 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) < 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        else:
            if (x - stand) < 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) > 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        #print(cur,x,i)
        change += cur
    to = change % N
    #print(change,to)

    import numpy as np
    if flag_R:
        V = np.roll(V, to)
    else:
        V = np.roll(V, -to)

    ans = [0]*N
    for i in range(N):
        ans[ans_num[i]] = V[i]
    for v in ans:
        print(v)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examC()

"""

"""

Submission status: Wrong Answer

Solution code:
def examA():
    N = I()
    A = LI()
    ans = 1
    flag = None
    for i in range(N-1):
        cur = A[i+1] - A[i]
        if not flag:
            if cur<0:
                flag = "d"
            elif cur>0:
                flag = "u"
        else:
            if cur<0 and flag=="u":
                flag = None
                ans += 1
            elif cur>0 and flag=="d":
                flag = None
                ans += 1
    print(ans)
    return

def examB():
    def bfs(n,V):
        W = [inf] * n
        W[0] = 0
        que = deque()
        que.append(0)
        while (que):
            now = que.popleft()
            nowW = W[now]
            if nowW==0:
                judge = 0
            elif nowW>0:
                judge = 1
            else:
                judge = -1
            if judge<0:
                cur = -1
            else:
                cur = 1

            for ne in V[now]:
                #print(now,ne)
                if cur+1<judge:
                    break
                if W[ne]!=inf:
                    continue
                W[ne] = nowW + cur
                que.append(ne)
                cur -= 2
        return W
    N, M = LI()
    V = [[]for _ in range(N)]
    for _ in range(M):
        a, b = LI()
        a -= 1; b -= 1
        V[a].append(b)
        V[b].append(a)

    L = bfs(N,V)
    D = defaultdict(int)
    minA = 0; maxA = 0
    for i,a in enumerate(L,start=1):
        if a!=inf:
            D[a] = i
            if a<minA:
                minA = a
            if a>maxA:
                maxA = a
    ans = []
    for i in range(minA,maxA+1):
        ans.append(D[i])
    print(len(ans))
    print(" ".join(map(str,ans)))
    return

def examC():
    N, L, T = LI()
    X = [[]for _ in range(N)]
    for i in range(N):
        cur = LI()
        cur.append(i)
        X[i] = cur
    #print(X)
    X.sort()
    ans_num = defaultdict(int)
    for j,[x,w,i] in enumerate(X):
        ans_num[j] = i

    X_R = []
    X_L = []
    flag_R = False
    for x,w,i in X:
        if w==1:
            if i==0:
                flag_R = True
            X_R.append([x,i])
        else:
            X_L.append([x,i])
    V = []
    for i in range(N):
        now = T if X[i][1]==1 else -T
        cur = (X[i][0] + now)%L
        cur = (cur+L)%L
        V.append(cur)
    change = 0
    if flag_R:
        stand = X_R[0][0]
    else:
        stand = X_L[0][0]
    for x,i in X_L if flag_R else X_R:
        cur = (2*T)//L
        if flag_R:
            if (x - stand) > 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) <= 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        else:
            if (x - stand) < 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) >= 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        #print(cur,x,i)
        change += cur
    to = change % N
    #print(change,to)

    import numpy as np
    if flag_R:
        V = np.roll(V, to)
    else:
        V = np.roll(V, -to)

    ans = [0]*N
    for i in range(N):
        ans[ans_num[i]] = V[i]
    for v in ans:
        print(v)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examC()

"""

"""

Submission status: Wrong Answer

Solution code:
def examA():
    N = I()
    A = LI()
    ans = 1
    flag = None
    for i in range(N-1):
        cur = A[i+1] - A[i]
        if not flag:
            if cur<0:
                flag = "d"
            elif cur>0:
                flag = "u"
        else:
            if cur<0 and flag=="u":
                flag = None
                ans += 1
            elif cur>0 and flag=="d":
                flag = None
                ans += 1
    print(ans)
    return

def examB():
    def bfs(n,V):
        W = [inf] * n
        W[0] = 0
        que = deque()
        que.append(0)
        while (que):
            now = que.popleft()
            nowW = W[now]
            if nowW==0:
                judge = 0
            elif nowW>0:
                judge = 1
            else:
                judge = -1
            if judge<0:
                cur = -1
            else:
                cur = 1

            for ne in V[now]:
                #print(now,ne)
                if cur+1<judge:
                    break
                if W[ne]!=inf:
                    continue
                W[ne] = nowW + cur
                que.append(ne)
                cur -= 2
        return W
    N, M = LI()
    V = [[]for _ in range(N)]
    for _ in range(M):
        a, b = LI()
        a -= 1; b -= 1
        V[a].append(b)
        V[b].append(a)

    L = bfs(N,V)
    D = defaultdict(int)
    minA = 0; maxA = 0
    for i,a in enumerate(L,start=1):
        if a!=inf:
            D[a] = i
            if a<minA:
                minA = a
            if a>maxA:
                maxA = a
    ans = []
    for i in range(minA,maxA+1):
        ans.append(D[i])
    print(len(ans))
    print(" ".join(map(str,ans)))
    return

def examC():
    N, L, T = LI()
    X = [[]for _ in range(N)]
    for i in range(N):
        cur = LI()
        cur.append(i)
        X[i] = cur
    #print(X)
    X.sort()
    ans_num = defaultdict(int)
    for j,[x,w,i] in enumerate(X):
        ans_num[i] = j

    X_R = []
    X_L = []
    flag_R = False
    for x,w,i in X:
        if w==1:
            if i==0:
                flag_R = True
            X_R.append([x,i])
        else:
            X_L.append([x,i])
    V = []
    for i in range(N):
        now = T if X[i][1]==1 else -T
        cur = (X[i][0] + now)%L
        cur = (cur+L)%L
        V.append(cur)
    change = 0
    if flag_R:
        stand = X_R[0][0]
    else:
        stand = X_L[0][0]
    for x,i in X_L if flag_R else X_R:
        cur = (2*T)//L
        if flag_R:
            if (x - stand) > 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) <= 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        else:
            if (x - stand) < 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) >= 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        #print(cur,x,i)
        change += cur
    to = change % N
    #print(change,to)

    import numpy as np
    if flag_R:
        V = np.roll(V, to)
    else:
        V = np.roll(V, -to)

    ans = [0]*N
    for i in range(N):
        ans[ans_num[i]] = V[i]
    for v in ans:
        print(v)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examC()

"""

"""

Submission status: Wrong Answer

Solution code:
def examA():
    N = I()
    A = LI()
    ans = 1
    flag = None
    for i in range(N-1):
        cur = A[i+1] - A[i]
        if not flag:
            if cur<0:
                flag = "d"
            elif cur>0:
                flag = "u"
        else:
            if cur<0 and flag=="u":
                flag = None
                ans += 1
            elif cur>0 and flag=="d":
                flag = None
                ans += 1
    print(ans)
    return

def examB():
    def bfs(n,V):
        W = [inf] * n
        W[0] = 0
        que = deque()
        que.append(0)
        while (que):
            now = que.popleft()
            nowW = W[now]
            if nowW==0:
                judge = 0
            elif nowW>0:
                judge = 1
            else:
                judge = -1
            if judge<0:
                cur = -1
            else:
                cur = 1

            for ne in V[now]:
                #print(now,ne)
                if cur+1<judge:
                    break
                if W[ne]!=inf:
                    continue
                W[ne] = nowW + cur
                que.append(ne)
                cur -= 2
        return W
    N, M = LI()
    V = [[]for _ in range(N)]
    for _ in range(M):
        a, b = LI()
        a -= 1; b -= 1
        V[a].append(b)
        V[b].append(a)

    L = bfs(N,V)
    D = defaultdict(int)
    minA = 0; maxA = 0
    for i,a in enumerate(L,start=1):
        if a!=inf:
            D[a] = i
            if a<minA:
                minA = a
            if a>maxA:
                maxA = a
    ans = []
    for i in range(minA,maxA+1):
        ans.append(D[i])
    print(len(ans))
    print(" ".join(map(str,ans)))
    return

def examC():
    N, L, T = LI()
    X = [[]for _ in range(N)]
    for i in range(N):
        cur = LI()
        cur.append(i)
        X[i] = cur
    #print(X)
    X.sort()
    conn = defaultdict(int)
    for j,[x,w,i] in enumerate(X):
        conn[i] = j

    X_R = []
    X_L = []
    flag_R = False
    for x,w,i in X:
        if w==1:
            if i==0:
                flag_R = True
            X_R.append([x,i])
        else:
            X_L.append([x,i])
    V = []
    for i in range(N):
        now = T if X[i][1]==1 else -T
        cur = (X[i][0] + now)%L
        cur = (cur+L)%L
        V.append(cur)
    change = 0
    if flag_R:
        stand = X_R[0][0]
    else:
        stand = X_L[0][0]
    for x,i in X_L if flag_R else X_R:
        cur = (2*T)//L
        if flag_R:
            if (x - stand) > 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) <= 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        else:
            if (x - stand) < 0 and x - stand <= (2 * T) % L:
                cur += 1
            elif (x - stand) >= 0 and L - (x - stand) <= (2 * T) % L:
                cur += 1
        #print(cur,x,i)
        change += cur
    to = change % N
    #print(change,to)

    import numpy as np
    if flag_R:
        V = np.roll(V, to)
    else:
        V = np.roll(V, -to)

    ans = [0]*N
    for i in range(N):
        ans[i] = V[conn[i]]
    for v in ans:
        print(v)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examC()

"""

"""

Submission status: Wrong Answer

Solution code:
def examA():
    N = I()
    A = LI()
    ans = 1
    flag = None
    for i in range(N-1):
        cur = A[i+1] - A[i]
        if not flag:
            if cur<0:
                flag = "d"
            elif cur>0:
                flag = "u"
        else:
            if cur<0 and flag=="u":
                flag = None
                ans += 1
            elif cur>0 and flag=="d":
                flag = None
                ans += 1
    print(ans)
    return

def examB():
    def bfs(n,V):
        W = [inf] * n
        W[0] = 0
        que = deque()
        que.append(0)
        while (que):
            now = que.popleft()
            nowW = W[now]
            if nowW==0:
                judge = 0
            elif nowW>0:
                judge = 1
            else:
                judge = -1
            if judge<0:
                cur = -1
            else:
                cur = 1

            for ne in V[now]:
                #print(now,ne)
                if cur+1<judge:
                    break
                if W[ne]!=inf:
                    continue
                W[ne] = nowW + cur
                que.append(ne)
                cur -= 2
        return W
    N, M = LI()
    V = [[]for _ in range(N)]
    for _ in range(M):
        a, b = LI()
        a -= 1; b -= 1
        V[a].append(b)
        V[b].append(a)

    L = bfs(N,V)
    D = defaultdict(int)
    minA = 0; maxA = 0
    for i,a in enumerate(L,start=1):
        if a!=inf:
            D[a] = i
            if a<minA:
                minA = a
            if a>maxA:
                maxA = a
    ans = []
    for i in range(minA,maxA+1):
        ans.append(D[i])
    print(len(ans))
    print(" ".join(map(str,ans)))
    return

def examC():
    N, L, T = LI()
    X = [[]for _ in range(N)]
    for i in range(N):
        cur = LI()
        cur.append(i)
        X[i] = cur
    #print(X)
    X.sort()
    conn = defaultdict(int)
    for j,[x,w,i] in enumerate(X):
        conn[i] = j

    X_R = []
    X_L = []
    flag_R = False
    for x,w,i in X:
        if w==1:
            if i==0:
                flag_R = True
            X_R.append([x,i])
        else:
            X_L.append([x,i])
    V = []
    for i in range(N):
        now = T if X[i][1]==1 else -T
        cur = (X[i][0] + now)%L
        cur = (cur+L)%L
        V.append(cur)
    change = 0
    if flag_R:
        stand = X_R[0][0]
    else:
        stand = X_L[0][0]
    for x,i in X_L if flag_R else X_R:
        cur = T//L
        if x>stand and x-stand>=T%L:
            cur += 1
        elif x<=stand and L+x-stand>=T%L:
            cur += 1
        change += cur
    to = change % N

    import numpy as np
    V = np.roll(V, to)

    ans = [0]*N
    for i in range(N):
        ans[i] = V[conn[i]]
    for v in ans:
        print(v)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examC()

"""

"""

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, L: int, T: int, X: "List[int]", W: "List[int]"):
    r=0
    x=0#基準座標
    w=0#基準index
    ans=[]
    f=True
    for i in range(N):
        if(W[i]==1):
            w=i
            x=X[i]
            f=False
            break
    if f :#全員逆向き
        for i in range(N):
            X[i]-=T%L
            if X[i]<0:
                X[i]+=L
        ans=X
        print("\n".join(map(str,ans)))
        return
    
    #基準より前にいるやつで逆のやつがいたら遠さからrをカウント
    for i in range(N):
        if W[(i+w)%(N)]==2:
            tmp=X[(i+w)%(N)]
            if(tmp>x):diff=tmp-x
            else: diff=tmp-x+L
            
            if(diff)/2<=T:
                r+=1+(T-(diff)/2)//(L/2)
                if ((T-(diff)/2)%(L/2)==0 and ((T-(diff)/2)//(L/2)>0)):
                    r-=1
    # print(r)
    for i in range(N):
            if(W[i]==1):
                X[i]+=T%L
            else:
                X[i]-=T%L
            if(X[i]>L):
                X[i]-=L
                    
            if(X[i]<0):
                X[i]+=L
            
    r%=N
    r=int(r)
    # print(X)
    # print(r)
    ans=X
    # print(ans[N-r:N],ans[0:N-r])
    ans=ans[N-r:N][::-1]+ans[0:N-r]
    print("\n".join(map(str,ans)))
    return
    

                



# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    L = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    X = [int()] * (N)  # type: "List[int]"
    W = [int()] * (N)  # type: "List[int]"
    for i in range(N):
        X[i] = int(next(tokens))
        W[i] = int(next(tokens))
    solve(N, L, T, X, W)

if __name__ == '__main__':
    main()