#include<bits/stdc++.h>
using namespace std;
struct pos{
    int x,y;
};
pos pc[100001];
int n,k,i,r[100001],j,ans[100001],indx,tr[100001];
long double s[100001],tt,mt=LONG_MAX*1.0,tp,t;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

freopen("runners.in","r",stdin);
freopen("runners.out","w",stdout);
cin>>n>>k;
for(i=1;i<=k;i++) cin>>s[i];
for(i=1;i<=n;i++) cin>>pc[i].x>>pc[i].y;
for(i=1;i<=k;i++) tr[i]=i;

do{
    //for(i=1;i<=k;i++) cout<<tr[i]<<" ";
    //cout<<'\n';
    for(i=1;i<=n;i++) r[i]=tr[i];
    tt=0;
    for(i=k+1;i<=n;i++){
        tp=LONG_MAX*1.0;
        for(j=1;j<=k;j++){
            t=s[j]*sqrt((pc[i].x-pc[r[j]].x)*(pc[i].x-pc[r[j]].x)+(pc[i].y-pc[r[j]].y)*(pc[i].y-pc[r[j]].y));
            if(t<tp){
                tp=t;
                indx=j;
            }
        }
        //cout<<tp<<'\n';
        r[indx]=i;
        tt+=tp;
    }
    //cout<<tt<<'\n';
    if(tt<mt){
        mt=tt;
        for(i=1;i<=n;i++) ans[i]=tr[i];
    }
} while(next_permutation(tr+1,tr+1+k));

for(i=1;i<=k;i++) cout<<pc[ans[i]].x<<" "<<pc[ans[i]].y<<'\n';
for(i=1;i<=k;i++){
    for(j=1;j<=k;j++){
        if(ans[j]==i) cout<<j<<'\n';
    }
}
for(i=k+1;i<=n;i++){
    tp=LONG_MAX*1.0;
    for(j=1;j<=k;j++){
        t=s[j]*sqrt((pc[i].x-pc[ans[j]].x)*(pc[i].x-pc[ans[j]].x)+(pc[i].y-pc[ans[j]].y)*(pc[i].y-pc[ans[j]].y));
        if(t<tp){
            tp=t;
            indx=j;
        }
    }
    cout<<indx<<'\n';
}

//cout<<mt;



return 0;
}