B"You are given a strictly convex polygon with n vertices. You will make k cuts that meet the following conditions: Your task is to maximize the area of the smallest region that will be formed by the polygon and those k cuts. The first line contains two integers n , k ( 3 <= n <= 200 , 0 <= k <= n-3 ). The following n lines describe vertices of the polygon in anticlockwise direction. The i -th line contains two integers x_i , y_i ( |x_i|, |y_i| <= 10^8 ) -- the coordinates of the i -th vertex. It is guaranteed that the polygon is convex and that no two adjacent sides are parallel. Print one integer: the maximum possible area of the smallest region after making k cuts multiplied by 2 . In the first example, it's optimal to make cuts between the following pairs of vertices: In the second example, it's optimal to make cuts between the following pairs of vertices: "...