#include<bits/stdc++.h>

 #include<tr1/unordered_map>

 #define CLR(a,x) memset(a,x,sizeof(a))

 #define MP make_pair

 #define fi first

 #define se second

 using namespace std;

 typedef long long ll;

 typedef unsigned long long ull;

 typedef long double ld;

 typedef pair<int,int> pa;

 const int maxn=1e5+;

 inline ll rd(){

     ll x=;char c=getchar();int neg=;

     while(c<''||c>''){if(c=='-') neg=-;c=getchar();}

     while(c>=''&&c<='') x=x*+c-'',c=getchar();

     return x*neg;

 }

 int L,N,x[maxn],dir[maxn],y[maxn],rnk[maxn],T,ans[maxn];

 inline bool cmp(int a,int b){return x[a]<x[b];}

 int main(){

     //freopen("","r",stdin);

     N=rd(),L=rd(),T=rd();

     for(int i=;i<=N;i++) x[i]=rd(),dir[i]=(rd()==?:-),rnk[i]=i;

     sort(rnk+,rnk+N+,cmp);

     ll p=;

     for(int i=;i<=N;i++){

         y[i]=((x[i]+T*dir[i])%L+L)%L;

         if(dir[i]==) p+=ceil(1.0*(T-(L-x[i])+)/L);

         else p-=ceil(1.0*(T-x[i])/L);

         // printf(":%d\n",p);

     }

     p=(p%N+N)%N;

     sort(y+,y+N+);

     for(int i=p+;i<=N;i++) ans[rnk[i-p]]=y[i];

     for(int i=;i<=p;i++) ans[rnk[N+i-p]]=y[i];

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

     return ;

 }