# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

# Points

By nahidhasan98 · Limits 1s, 512 MB

You will be given two-dimensional coordinates $(x, y)$ of $N$ points. Your task is to identify $K$ points from them that are lying in a straight line (This line should contain exactly $K$ points). It is guaranteed that all points are unique and there is exactly one such line exists in which exactly $K$ points lie.

## Input

The first line of the input contains two integers $N$ and $K$.

The next $N$ lines contain the description of $N$ points. The $i$ th line contains two integers $x_i$ and $y_i$ that denote the coordinates of the $i$ th point.

Constraints:

• $2 \leq K \leq N \leq 10000$

• $-1000 \leq x_i, y_i \leq 1000$

## Output

Print the coordinates of the $K$ points one line each according to the input order.

## Sample

InputOutput
4 3
1 1
1 2
2 2
3 3
1 1
2 2
3 3

### Statistics

64% Solution Ratio

s_semicolonEarliest, 1M ago

RakibJoyFastest, 0.0s

s_semicolonLightest, 561 kB

serotoninShortest, 1321B