#include<bits/stdc++.h>
using namespace std;

#define endl "\n";

const long long MAX_Q = 1e5 + 10;
const long long MAX_N = 1e5 + 10;

float dist(long long x1, long long y1, long long x2, long long y2){
    return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}

struct runner
{
    long long sX;
    long long sY;
    long long x;
    long long y;
    float speed;
};

runner runs[MAX_Q];

long long stepsAtATime;

long long n, q;
pair<long long, long long> problems[MAX_N];

int main(){
    freopen("runners.in", "r", stdin);
    freopen("runners.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    cin>>n>>q;
    stepsAtATime = 500000000 / q;
    for(long long i = 0; i < q; i++){
        float s; cin>>s;
        runs[i].speed = s;
    }

    for(long long i = 0; i < n; i++){
        long long x, y; cin>>x>>y;
        if(i < q){
            runs[i].sX = runs[i].x = x;
            runs[i].sY = runs[i].y = y;
        }
        problems[i] = {x, y};
    }

    for(long long i = 0; i < q; i++){
        cout<<runs[i].sX<<" "<<runs[i].sY<<endl;
    }

    for(long long i = 0; i < n; i++){
        long long currentSteps = 20;
        if(i < q){
            cout<<i + 1<<endl;
            continue;
        }
        float minDist = runs[0].speed * dist(problems[i].first, problems[i].second, runs[0].x, runs[0].y);
        long long minIndex = 0;
        for(long long j = 1; j < q && currentSteps < stepsAtATime; j++){
            float cDist = runs[j].speed * dist(problems[i].first, problems[i].second, runs[j].x, runs[j].y);
            if(cDist < minDist){
                minIndex = j;
                minDist = cDist;
            }
        }
        runs[minIndex].x = problems[i].first;
        runs[minIndex].y = problems[i].second;
        cout<<minIndex + 1<<endl;
    }
    
    return 0;
}