A

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;

#define N 310
#define inf 0x7fffffff

struct point 
{
    int x,y;
}dd[N];

int n,p;
int dp[N][N];
int cost[N][N];//边的花费

bool cmp(const point& a,const point &b){    
    if(a.y == b.y)return a.x < b.x;  
    return a.y < b.y;  
}  

point save[400],temp[400]; 

int xmult(point p1,point p2,point p0){    
    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);  
}  

int Graham(point *p,int n){
    int i;  
    sort(p,p + n,cmp);  
    save[0] = p[0];  
    save[1] = p[1];  
    int top = 1;  
    for(i = 0;i < n; i++){  
  
        while(top && xmult(save[top],p[i],save[top-1]) >= 0) top--;  
        save[++top] = p[i];  
    }  
    int mid = top;  
    for(i = n - 2; i >= 0; i--){
        while(top>mid&&xmult(save[top],p[i],save[top-1]) >= 0) top--;  
        save[++top]=p[i];  
    }  
    return top;  
}  

int min(int a,int b){return a<b?a:b;};

void init()
{
    int i,j;
    for(i = 0;i < n;i++){
        scanf("%d%d",&dd[i].x,&dd[i].y);
    }
    for(i = 0;i < n;i++){
        dp[i][(i+1)%n] = 0;
        cost[i][(i+1)%n] = cost[(i+1)%n][i]=0;
    }
}

int Dp()
{
    int i,j,k;
    for(i = n-3;i >= 0;i--)//注意三个循环的方向
    for(j = i+2;j < n;j++)//第一个循环从后往前 第二个循环从前往后是为了保证当前用到的状态都已经被计算过了 已经是最优的了
    for(k = i+1;k < j;k++)
        dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j]+cost[i][k]+cost[k][j]);
    return dp[0][n-1];
}

int main()
{
    int tot, i, j;
    while(scanf("%d%d", &n, &p)!=EOF)
    {
        init();
        tot    = Graham(dd,n);
        for(i = 0;i < n;i++)
        for(j = i+2;j < n;j++){
            dp[i][j] = inf;
            cost[i][j] = cost[j][i] = ((abs(save[i].x+save[j].x))*(abs(save[i].y+save[j].y)))%p;
        }
        //判断是否是凸多边形
        if(tot < n){
            printf("I can't cut.
");
        }
        else{
            int ans = Dp();
            printf("%d
",ans);
        }
    }
    return 0;
}