#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct node{
    int id, v, t, g;
};
vector<node> v[4];

int cmp(node &a, node &b) {
    if (a.g != b.g)
        return a.g > b.g;
    else if (a.v != b.v)
        return a.v > b.v;
    else
        return a.id < b.id;
}
void Sort(vector<node> &a){ sort(a.begin(), a.end(), cmp); }
void print(vector<node> &a){
    Sort(a);
    for (int i = 0; i < a.size(); i++)
        printf("%d %d %d\n", a[i].id, a[i].v, a[i].t);
}

int main() {
    int n, l, h, cnt;
    cin >> n >> l >> h;
    cnt = n;
    for (int i = 0; i < n; i++) {
        int id, vi, t;
        scanf("%d %d %d", &id, &vi, &t);
        if (vi >= l && t >= l){
            node temp{id, vi, t, vi+t};
            if(vi >= h && t >= h) v[0].push_back(temp);
            else if(vi >= h && t < h) v[1].push_back(temp);
            else if(vi < h && t < h && vi >= t) v[2].push_back(temp);
            else v[3].push_back(temp);
        }else cnt--;
    }
    cout << cnt << endl;
    for (int i = 0; i < 4; i++) print(v[i]);
    return 0;
}