/**

 * Copyright(c)

 * All rights reserved.

 * Author : Ycute

 * Date : 2019-10-30-19.49.12

 * Description : struct排序

 */

 #include<iostream>

 #include<cstdio>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 struct stu{

     int id;

     int c1;

     int c2;

 };

 bool cmp(struct stu a,struct stu b){

     if((a.c1+a.c2)==(b.c1+b.c2)){

         if(a.c1==b.c1){

             return a.id<b.id?true:false;

         }else{

             return a.c1>b.c1?true:false;

         }

     }else{

         return (a.c1+a.c2)>(b.c1+b.c2)?true:false;

     }

 }

 struct stu p1[];

 struct stu p2[];

 struct stu p3[];

 struct stu p4[];

 int main(){

     int num,C1,C2;

     scanf("%d %d %d",&num,&C1,&C2);

     int tot=;

     int l1=,l2=,l3=,l4=;

     for(int i=;i<num;++i){//输入并进行分组

         int a,b,c;

         scanf("%d %d %d",&a,&b,&c);

         if(b<C1||c<C1)continue;

         if(b>=C2&&c>=C2){

             p1[l1].id=a;

             p1[l1].c1=b;

             p1[l1++].c2=c;

         } else if(b>=C2){

             p2[l2].id=a;

             p2[l2].c1=b;

             p2[l2++].c2=c;

         }else if(b>=c){

             p3[l3].id=a;

             p3[l3].c1=b;

             p3[l3++].c2=c;

         }else{

             p4[l4].id=a;

             p4[l4].c1=b;

             p4[l4++].c2=c;

         }

         ++tot;

     }

 　　//排序

     sort(p1,p1+l1,cmp);

     sort(p2,p2+l2,cmp);

     sort(p3,p3+l3,cmp);

     sort(p4,p4+l4,cmp);

     //cout<<l1<<" "<<l2<<" "<<l3<<" "<<l4<<endl;

     printf("%d\n",tot);

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

         printf("%d %d %d\n",p1[i].id,p1[i].c1,p1[i].c2);

     }

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

         printf("%d %d %d\n",p2[i].id,p2[i].c1,p2[i].c2);

     }

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

         printf("%d %d %d\n",p3[i].id,p3[i].c1,p3[i].c2);

     }

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

         printf("%d %d %d\n",p4[i].id,p4[i].c1,p4[i].c2);

     }

     return ;

 }