\(6^{th}\) round, April \(14^{th}\), 2012

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: R_{i} for the red,
G_{i} for the green and B_{i} for the blue component.
The difference between the i^{th} and the j^{th} crayon is max(|\(R_{i} - R_{j}\)|, |\(G_{i} - G_{j}\)|, |\(B_{i} - B_{j}\)|). 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!

In test cases worth 50% of total points, \(0 \le R_{i}\), G_{i}, \(B_{i} \le 20\) will hold.
In test cases worth additional 30% of total points, \(0 \le R_{i}\), G_{i}, \(B_{i} \le 50\) will hold.

The first line of input contains integers N and K (\(2 \le K \le N \le 100\,000\)).
The i^{th} of the folowing N lines contains three integers R_{i}, G_{i} and B_{i} (\(0 \le R_{i}\), G_{i}, \(B_{i} \le 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.

생성자가 기록되지 않았습니다.

출처 COCI 2011/2012 Contest 6