#include<iostream>
#include<cmath>
#include <fstream>

using namespace std;

const int maxK=105;
const int MAXN=100005;


struct point{
    int id;
    int x;
    int y;

};

struct runner{
    int id;
    int posID;
    float speed;
};



int main()
{
    int n;
    point add[MAXN];
    float currDist;
    runner runners[maxK];

    int minDist =INT_MAX;
        int minDistID;

    int k;


     ifstream infile;
        infile.open("runners.in");
       ofstream outfile;
   outfile.open("runners.out");



    infile >> n >> k;

    for(int i =0; i<k;i++)
    {
        infile>>runners[i].speed;
        runners[i].posID=i;
        runners[i].id = i;
    }

    for(int i=0;i<n;i++)
    {
    add[i].id = i;
    infile >> add[i].x>>add[i].y;

    }




/*
    for(int i=0;i<n;i++)
    {
        for(int j = i; j<n;j++)
            {
            currDist = sqrt((add[i].x - add[j].x)*(add[i].x - add[j ].x) + (add[i].y - add[j].y)*(add[i].y - add[j].y));

            distBetwPoints[i][j] = currDist;
            distBetwPoints[j][i] = currDist;

            }

    }

    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)

            cout<<i<<' '<<j<<" "<<distBetwPoints[i][j]<<'\n';
    }*/

    for (int i =0;i<k;i++)
    {
        outfile <<add[runners[i].posID].x << " " << add[runners[i].posID].y << "\n";

    }



    for(int i=0;i<n;i++)
    {
        minDist = INT_MAX;
        minDistID = -1;
        for(int j=0;j<k;j++)
        {

            currDist = sqrt((add[i].x - add[runners[j].posID].x)*(add[i].x - add[runners[j].posID].x) + (add[i].y - add[runners[j].posID].y)*(add[i].y - add[runners[j].posID].y));

            if(currDist * runners[j].speed <= minDist)
            {
                minDistID = runners[j].id;
                minDist = currDist * runners[j].speed;
            }

        }

        //cout<<i << "->" << minDistID+1 << " za " << minDist << '\n';
        outfile<<minDistID+1<<'\n';
        runners[minDistID].posID = i;

    }
    outfile.close();


    return 0;
}