# include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
struct stu{
int num;
int scored;
int scorec;
bool operator <(const stu &tmp) const {
if (scorec+scored != tmp.scored+tmp.scorec)
return scored+scorec > tmp.scored+tmp.scorec;
else if (scored != tmp.scored)
return scored > tmp.scored;
else return num < tmp.num;
}
};
int main()
{
int n, l, h;
vector<stu> stu1, stu2, stu3, stu4;
stu tmp;
int ct = 0 ;
scanf(" %d %d %d " ,&n,&l,&h);
for (int i = 0 ; i < n; ++i){
scanf(" %d %d %d " , &tmp.num, &tmp.scored, &tmp.scorec);
if (tmp.scorec >= l&&tmp.scored >= l){
++ct;
if (tmp.scorec >= h&&tmp.scored >= h) stu1.push_back(tmp);
else if (tmp.scored >= h) stu2.push_back(tmp);
else if (tmp.scored>=tmp.scorec) stu3.push_back(tmp);
else stu4.push_back(tmp);
}
}
sort(stu1.begin(), stu1.end());
sort(stu2.begin(), stu2.end());
sort(stu3.begin(), stu3.end());
sort(stu4.begin(), stu4.end());
printf(" %d \n " , ct);
for (auto i = stu1.begin(); i != stu1.end(); ++i) printf(" %d %d %d \n " , i->num, i->scored, i->scorec); for (auto i = stu2.begin(); i != stu2.end(); ++i) printf(" %d %d %d \n " , i->num, i->scored, i->scorec); for (auto i = stu3.begin(); i != stu3.end(); ++i) printf(" %d %d %d \n " , i->num, i->scored, i->scorec); for (auto i = stu4.begin(); i != stu4.end(); ++i) printf(" %d %d %d \n " , i->num, i->scored, i->scorec); return 0 ;}