B"It is the year 2969. 1000 years have passed from the moon landing. Meanwhile, the humanity colonized the Hyperspace xe2 x84 xa2 and lived in harmony. Until we realized that we were not alone. Not too far away from the Earth, the massive fleet of aliens' spaceships is preparing to attack the Earth. For the first time in a while, the humanity is in real danger. Crisis and panic are everywhere. The scientists from all around the solar system have met and discussed the possible solutions. However, no progress has been made. The Earth's last hope is YOU! Fortunately, the Earth is equipped with very powerful defense systems made by MDCS. There are N aliens' spaceships which form the line. The defense system consists of three types of weapons: Your task is to make a plan of the attack which will destroy the largest possible number of spaceships. Every destroyed spaceship should be destroyed with exactly one weapon. The first line contains two integers: the number of your weapons N (1 <= q N <= q 5000) and the number of spaceships M (1 <= q M <= q 5000) . In the next N lines, each line starts with one integer that represents type (either 0, 1 or 2). If the type is 0, then the weapon is SQL rocket, the rest of the line contains strictly positive number K ( sum{K} <= q 100 000) and array k_i (1 <= q k_i <= q M) of K integers. If the type is 1, then the weapon is Cognition beam, the rest of the line contains integers l and r (1 <= q l <= q r <= q M) . If the type is 2 then the weapon is OMG bazooka, the rest of the line contains distinct numbers a , b and c (1 <= q a,b,c <= q M) . The first line should contain the maximum number of destroyed spaceships -- X . In the next X lines, every line should contain two numbers A and B , where A is an index of the weapon and B is an index of the spaceship which was destroyed by the weapon A . SQL rocke"...