#include <bits/stdc++.h>
using namespace std;
int N,X=100000,Y=100000,D,X1[100006],Y1[100005];
int br=1,tx,ty;
int broj=0;
struct slog {
int x;
int y;
int mesto;
int res;
float VREME;
int trenx;
int treny;

};
bool cmp2(slog A,slog B){
return A.mesto<B.mesto;
}
slog a[100005];
slog a1[100005];
int main(){
   freopen("runners.in","r",stdin);
   freopen("runners.out","w",stdout);
  cin>>N>>D;
  for(int i=1;i<=D;i++){
    cin>>a1[i].VREME;
  }
  for(int i=1;i<=N;i++){
  cin>>a[i].x>>a[i].y;
  a[i].mesto=i;
  if(a[i].x<X){X=a[i].x;Y=a[i].y;}
  }
  for(int i=1;i<N;i++){
        int mm=(a[i].x-a[i=1].x)*(a[i].x-a[i-1].x)+(a[i].y-a[i-1].y)*(a[i].y-a[i-1].y);
        int mestoo=i;
    for(int j=i+1;j<=N;j++){
        if((a[j].x-a[i-1].x)*(a[j].x-a[i-1].x)+(a[j].y-a[i-1].y)*(a[j].y-a[i-1].y)<mm){
            mm=(a[j].x-a[i-1].x)*(a[j].x-a[i-1].x)+(a[j].y-a[i-1].y)*(a[j].y-a[i-1].y);
            mestoo=j;
        }
        swap(a[i],a[mestoo]);
      i++;
    }
  }

for(int i=1,j=1;i<=D;i++,j+=N/D){
        a[j].res=i;
        X1[i]=a[j].x;
        Y1[i]=a[j].y;
    }
    for(int i=1;i<=N;i++){
     if(a[i].res>a[i-1].res){broj++;}
     else a[i].res=broj;
    }

  sort(a+1,a+N+1,cmp2);
    for(int i=1;i<=D;i++){
        cout<<X1[i]<<" "<<Y1[i]<<endl;
    }
    for(int i=1;i<=N;i++){
        cout<<a[i].res<<endl;
    }
 return 0;
}