Language: C++

#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO()	{cin.tie(0);	cout.sync_with_stdio(false);}
#define reach(i,a)	for(auto i:a)
#define rep(i,n)	for(int i=0;i<(int)n;i++)
#define REP(i,n)	for(int i=0;i<=(int)n;i++)
#define srep(i,a,n)	for(int i=a;i<(int)n;i++)
#define SREP(i,a,n)	for(int i=a;i<=(int)n;i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define RREP(i,n)	for(int i=n;i>=0;i--)
#define all(a)	(a).begin(),(a).end()
#define mp(a,b)	make_pair(a,b)
#define mt	make_tuple
#define pb	push_back
#define fst	first
#define scn second
int bitcnt(ll x) {
	x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
	x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
	x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
	x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
	x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
	x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
	return x;
}
int bitcnt(int x) {
	x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
	x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
	x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
	x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
	x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
	return x;
}
ll gcd(ll a, ll b) {
	return a%b == 0 ? b : gcd(b, a%b);
}
#define debug(x)	cout<<"case #" << x << ": " << endl
#define DEBUG 0
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ld eps = 1e-15;
const int dx[] = { 1,0,-1,0,0 };
const int dy[] = { 0,1,0,-1,0 };

int main() {
	int n, l, t;	cin >> n >> l >> t;
	t <<= 1;	l <<= 1;
	t %= l;
	vector<ll> cw, ccw;
	vector<pair<ll, int>> dat;
	rep(i, n) {
		int x, w;	cin >> x >> w;
		x <<= 1;
		if (w == 1)	cw.push_back(-x);
		else	ccw.push_back(x);
		dat.push_back(mp(x, w));
	}
	sort(all(cw));	sort(all(ccw));
	int dir = dat[0].second;
	ll pos = dat[0].first;
	ll cur = 0;
	while (cur < t) {
		if (dir == 1) {
			if (ccw.size() == 0) {
				pos = (pos + t - cur + l) % l;
				cur = t;
			}
			else {
				int coll = upper_bound(all(ccw), (pos + cur) % l) - ccw.begin();
				if (coll == ccw.size()) {
					coll = 0;
				}
				ll opos = (ccw[coll] - cur + l) % l;
				ll dist = (l + opos - pos) % l;
				if (dist > 0 && cur + (dist >> 1) <= t) {
					cur += dist >> 1;
					pos = (pos + (dist >> 1)) % l;
					dir = 2;
				}
				else {
					pos = (pos + t - cur) % l;
					cur = t;
				}
			}
		}
		else {
			if (cw.size() == 0) {
				pos = (pos + l - t) % l;
				cur = t;
			}
			else {
				int coll = upper_bound(all(cw), -((pos - cur + l) % l)) - cw.begin();
				if (coll == cw.size())	coll = 0;
				ll opos = (-cw[coll] + cur + l) % l;
				ll dist = (pos - opos + l) % l;
				if (dist > 0 && cur + (dist >> 1) <= t) {
					cur += dist >> 1;
					pos = (pos - (dist >> 1) + l) % l;
					dir = 1;
				}
				else {a
					pos = (pos - t + cur + l) % l;
					cur = t;
				}
			}
		}
	}
	vector<pair<ll, int>> after(n);
	rep(i, n)	after[i] = mp((dat[i].first + (dat[i].second == 1 ? 1 : -1) * t + l) % l, -dat[i].second);
	sort(all(after));
	int out = -1;
	rep(i, n) {
		if (after[i] == mp(pos, -dir)) {
			out = i;
			break;
		}
	}
	rep(i, n) {
		cout << (after[out].first >> 1) << endl;
		out = (out + 1) % n;
	}
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:132:39: error: 'a' was not declared in this scope
  132 |                                 else {a
      |                                       ^