#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MOD2 = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 1e5 + 5;
int n, w, h;
int d[maxn];
int p[maxn];
map<int, vector<pair<int, int> > > hs;
int f[maxn];
void solve() {
  cin >> n >> w >> h;
  for (int i = (0); i < (n); i++) {
    cin >> d[i];
    d[i]--;
    int t;
    cin >> p[i] >> t;
    hs[p[i] - t].push_back(make_pair(p[i], i));
  }
  for (__typeof((hs).begin()) it = (hs).begin(); it != (hs).end(); it++) {
    vector<pair<int, int> > v = it->second;
    sort((v).begin(), (v).end());
    vector<int> g[2];
    for (int i = (0); i < (int((v).size())); i++) {
      int ix = v[i].second;
      g[d[ix]].push_back(ix);
    }
    for (int k = (0); k < (2); k++) {
      for (int i = (0); i < (int((g[k]).size())); i++) {
        int ix = g[k][i];
        int x = int((g[k ^ 1]).size());
        int y = int((g[k]).size()) - i - 1;
        int mn = min(x, y) * 2;
        if (x > y) mn++;
        if (!(mn & 1)) {
          f[ix] = g[k][i + mn / 2];
        } else {
          f[ix] = g[k ^ 1][mn / 2];
        }
      }
    }
  }
  for (int i = (0); i < (n); i++) {
    int ix = f[i];
    if (!d[ix]) {
      cout << p[ix] << " " << h << "\n";
    } else {
      cout << w << " " << p[ix] << "\n";
    }
  }
}
int main() {
  int JUDGE_ONLINE = 1;
  if (fopen("in.txt", "r")) {
    JUDGE_ONLINE = 0;
    assert(freopen("in.txt", "r", stdin));
  } else {
    ios_base::sync_with_stdio(0), cin.tie(0);
  }
  solve();
  if (!JUDGE_ONLINE) {
  }
  return 0;
}
