Given an array a[0] .. a[n-1] of vectors, each vector being a k-tuple of the form
v = (c_1, c_2, c_3, ... , c_k)
where each c_j is a double. The norm of this vector is defined as
|v| = sqrt{ (c_1)^2 + (c_2)^2 + (c_3)^2 + ... + (c_k)^2 }.
From among the given vectors a[0] to a[n-1], find the vectors a[k] and positions k of the three vectors with the biggest norm values, and show these three vectors arranged from highest norm to lowest norm.
Input. The values of n and k on the first line, followed by the vectors themselves, one per line. For example:
6 3 1.5 -2.1 4.7 1.2 2.0 5.1 6.1 2.3 -1.5 2.0 -2.3 6.2 0.23 3.5 4.3 3.4 1.4 2.1
Output. As described above.