// Brute-force solution of picking up k objects on a line
// 3/28/05 BPW

#define MAX (20)

int inArray[MAX];
double mid[MAX*MAX];

#include <stdio.h>

int intCompare(const void* xin, const void* yin)
{
int *x,*y;

x=(int*) xin;
y=(int*) yin;
return (*x) - (*y);
}

int doubleCompare(const void* xin, const void* yin)
{
double *x,*y;
double z;

x=(double*) xin;
y=(double*) yin;
z=(*x) - (*y);
if (z==0.0)
  return 0;
if (z<0.0)
  return -1;
if (z>0.0)
  return 1;
}

// These map coordinates to 0 ... 530
#define TRANSX(X) (530.0*((X)-xmin)/xdiff)
#define TRANSY(Y) (530.0*((Y)-ymin)/ydiff)

main()
{
int n,k,i,j;
int nmid;
int left,right,count;
double sum;
double xdiff,ydiff;
double xmin,xmax,ymin,ymax,y;

scanf("%d %d",&n,&k);
inArray[0]=(-9999999);//sentinel
for (i=1;i<=n;i++)
  scanf("%d",&inArray[i]);
qsort(&inArray[1],n,sizeof(int),intCompare);
// Eliminate duplicates
j=1;
for (i=2;i<=n;i++)
  if (inArray[i]>inArray[j-1])
    inArray[++j]=inArray[i];
n=j;
inArray[n+1]=9999999;//sentinel
xmin=inArray[1];
xmax=inArray[n];
xdiff=xmax-xmin;
ymin=0.0;
// See O'Rourke, p. 206
ymin=9999999;
ymax=(-9999999);
for (i=1;i<=n;i++)
{
  y=2*inArray[i]*xmin-inArray[i]*inArray[i];
  if (y<ymin)
    ymin=y;
  if (y>ymax)
    ymax=y;
  y=2*inArray[i]*xmax-inArray[i]*inArray[i];
  if (y<ymin)
    ymin=y;
  if (y>ymax)
    ymax=y;
}
ydiff=ymax-ymin;

nmid=0;
for (i=1;i<n;i++)
  for (j=i+1;j<=n;j++)
    mid[nmid++]=(inArray[i]+inArray[j])/2.0;
qsort(mid,nmid,sizeof(double),doubleCompare);
// Eliminate duplicates
j=1;
for (i=1;i<nmid;i++)
  if (mid[i]>mid[j-1])
    mid[j++]=mid[i];
nmid=j;

printf("%%!PS\n");
printf("%%%%BoundingBox: 0 0 605 755\n");
/* The +72 shifts the figure one inch from the lower left corner */
printf("40 155 translate\n");
printf("0.5 setlinewidth\n");
for (i=1;i<=n;i++)
{
  printf("newpath\n");
  printf("%f %f moveto\n",TRANSX(xmin),
                          TRANSY(2*inArray[i]*xmin-inArray[i]*inArray[i]));
  printf("%f %f lineto\n",TRANSX(xmax),
                          TRANSY(2*inArray[i]*xmax-inArray[i]*inArray[i]));
  printf("stroke\n");
}

left=0;
for (i=0;i<nmid;i++)
{
  fprintf(stderr,"%f: ",mid[i]);
  for ( ;inArray[left+1]<=mid[i];left++)
    ;
  right=left+1;
  sum=0;
  for (count=0;count<k;count++)
    if (mid[i]-inArray[left]==inArray[right]-mid[i] && count==k-1)
    {
      printf("newpath\n");
      printf("%f %f 1 0 360 arc fill\n",TRANSX(mid[i]),
             TRANSY(2*inArray[left]*mid[i]-inArray[left]*inArray[left]));
      printf("%f %f 3 0 360 arc stroke\n",TRANSX(mid[i]),
             TRANSY(2*inArray[right]*mid[i]-inArray[right]*inArray[right]));
      fprintf(stderr,"%d (%d) ",left,right);
      sum+=mid[i]-inArray[left--];
    }
    else if (mid[i]-inArray[left]<inArray[right]-mid[i])
    {
      fprintf(stderr,"%d ",left);
      sum+=mid[i]-inArray[left--];
    }
    else
    {
      fprintf(stderr,"%d ",right);
      sum+=inArray[right++]-mid[i];
    }
  fprintf(stderr," sum %f\n",sum);
}
printf("showpage\n");
printf("%%EOF\n");
}