A1461.[COCI-2011_2012-contest6]#3 PASTELE

Mirko recently got N crayons as a gift. The color of each crayon is a combination of three primary colors: red, green and blue. The color of the i th crayon is represented with three integers: Ri for the red, Gi for the green and Bi for the blue component.
The difference between the i th and the j th crayon is max(|Ri - Rj|, |Gi - Gj|, |Bi - Bj|). The colorfulness of a subsequence of crayons is equal to the largest difference between any two crayons in the subsequence.
Mirko needs a subsequence with K crayons with the smallest colorfulness for his drawing. The subsequence does not have to be consecutive. Find it!

The first line of input contains integers N and K (2 ≤ K ≤ N ≤ 100 000).
The i th of the folowing N lines contains three integers Ri, Giand Bi(0 ≤ Ri, Gi, Bi ≤ 255).

The first line of output should contain the smallest colorfulness of a subsequence with K crayons.
The following K lines should contain the R, G and B values of the colors of the crayons in the subsequence, in any order. Any subsequence that yields the smallest colorfulness will be accepted.

In test cases worth 50% of total points, 0 ≤ Ri
, Gi
, Bi ≤ 20 will hold.
In test cases worth additional 30% of total points, 0 ≤ Ri
, Gi
, Bi ≤ 50 will hold.