A group of friends living in an -dimensional hyperspace want to meet up at some central location. The hyperspace is in the form of an -dimensional grid, and each person can only move along grid lines. For example, to go from in a -dimensional space, one possible route is for a total distance traveled of units.
Given the coordinates, , for friends, find a point at which all friends can meet such that the total sum of the distances traveled by all friends is minimal. If there are multiple such points, choose the lexicographically smallest one. The point is lexicographically smaller than if there exists such that and .
Input Format
The first line contains two space-separated integers describing the respective values of and .
Each line of the subsequent lines contains space-separated integers describing the respective coordinates (i.e., ) for friend .
Constraints
Output Format
Print space-separated integers describing the coordinates of the meeting point.
Sample Input
3 2
1 1
2 2
3 3
Sample Output
2 2
Explanation
There are friends (we'll call them , , and ) located at points , , and . The minimal solution is for friends and to meet at friend 's current location; this means travels units from to , travels units from to , and stays put at . The total distance traveled by all friends is , which is minimal. Thus, we print space-separated integers describing the coordinate where the friends meet: 2 2.