### IOI '04 - Athens, Greece

## Artemis

Zeus gave Artemis, the goddess of the wilderness, a rectangular area for growing a forest. With the left side of the area as a segment of the positive y-axis and the bottom side as a segment of the positive x-axis, and (0,0) the left bottom corner of the area, Zeus told Artemis to plant trees only on integer coordinate points in the area. Artemis liked the forest to look natural, and therefore planted trees in such a way that a line connecting two trees was never parallel to x-axis or y-axis.

At times, Zeus wants Artemis to cut trees for him. The trees are to be cut as follows:

- Zeus wants at least a given number
*T*of trees to be cut for him. - To get a rectangular football pitch for future football success, Artemis is to cut all trees within a rectangular area, and no trees outside of it.
- The sides of this rectangular area are to be parallel to x-axis and y-axis.
- Two opposite corners of the area must be located on trees and therefore those corner trees are also cut.

As Artemis likes the trees, she wants to fulfill these conditions whilst cutting as few trees as possible. You are to write a program that, given information on the forest and the minimum number T of trees to be cut, selects an area for cutting trees for Artemis.

### Input

The first line contains one integer*N*(1 ≤

*N*≤ 20000): the number of trees in the forest. The second line contains one integer

*T*(1 <

*T*≤

*N*): the minimum number of trees to be cut. The following

*N*lines describe the positions of the

*N*trees. Each of these lines contains two integers

*X*and

*Y*(0 ≤

*X*,

*Y*≤ 64000): the x-coordinate followed by the y-coordinate of a tree.

### Output

The output is to contain one line with two integers*I*and

*J*separated by one space: Artemis should use the

*I*

^{th}tree (with position given on line

*I*+2 of the input file) and

*J*

^{th}tree (with position given on line

*J*+2 of the input file) as the corners of the area for cutting trees. The order of these two number is irrelevant. There may be several ways to choose these trees and you need to find and output one of them. For all test cases at least one solution exists.

### Sample Input

3 2 1 1 2 3 5 6

### Sample Output

1 2

Note: in 50% of the inputs, 1 < *N* < 5000.

All Submissions

Best Solutions

**Point Value:** 15 (partial)

**Time Limit:** 2.00s

**Memory Limit:** 16M

**Added:** Jul 26, 2010

**Languages Allowed:**

C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

## Comments (Search)

It's quiet in here...