Find an Intersection Interval

You are given $n$ closed intervals on the integer number line. Each interval is defined by its endpoints $[a_i, b_i]$, where $a_i$ and $b_i$ are integers and the interval includes all integers $x$ such that $a_i \le x \le b_i$. You are also given an integer $k$. Your task is to find an integer $x$ such that $x$ lies in at least $k$ of the given intervals. If there are multiple valid answers, you may output any one of them. The answer should be presented as an interval with identical endpoints, i.e. $(x, x)$.

For example, consider the intervals $[1,5]$, $[4,8]$, and $[6,10]$ with $k=2$. The integer $4$ is contained in at least two intervals, so the output can be $(4,4)$.

inputFormat

The input is read from standard input (stdin) and has the following format:

The first line contains two integers $n$ and $k$, where $n$ is the number of intervals and $k$ is the required number of intervals that must intersect at a point. The next $n$ lines each contain two integers $a_i$ and $b_i$, representing the endpoints of the $i$-th interval.

outputFormat

Output a single line to standard output (stdout) containing two identical integers separated by a space, representing an interval $(x, x)$ where $x$ is an integer that lies in at least $k$ intervals.## sample

3 2
1 5
4 8
6 10

4 4