Not a Convex Hull (Challenge)

### Be careful!!! You are not allowed to submit this problem more than 99 times! Chef has $N$ randomly generated points with integer coordinates $(x_1, y_1), (x_2, y_2), \dots, (x_N, y_N)$. He asks you to perform the following operation: - choose up to $K$ of these points, i.e. a subsequence $\left\lbrace(x_{k_i}, y_{k_i})\right\rbrace_{i=1}^L$, where $0 \le L \le K$ - for each $1 \le i \le L$, c