The input is one test case. Your program may be run several times on different inputs.
The first line contains two integers n and k (3≤k<n≤100000), where n is the total number of trees and k is the number of trees you control.
Each of the next n lines contains two integers x and y (−109≤x,y≤109), the position of one tree. The first k trees in the list are the trees you control. No three trees are collinear. A tree you do not control may lie inside your shape.