#include <bits/stdc++.h>

using namespace std;

ifstream inF("runners.in");
ofstream outF("runners.out");

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    long long n, k, idx=1;
    inF >> n >> k;
    float* s = new float[100000];
    double* distance = new double[100000];
    pair<long long, long long>* runner = new pair<long long, long long>[100000];
    pair<long long, long long>* comp = new pair<long long, long long>[100000];
    double min_l;

    for (int i = 0; i < k; ++i)
    {
        inF >> s[i];
    }
    for (int i = 0; i < n; ++i)
    {
        inF>>comp[i].first;
        inF>>comp[i].second;
    }

    for(int i = 0; i<k; ++i)
    {
        runner[i].first=comp[i].first;
        runner[i].second=comp[i].second;
    }

    for(int i = 0; i<k; ++i)
    {
        outF<<runner[i].first<<" "<<runner[i].second<<'\n';
    }


    for(int i = 1; i<=k; ++i)
    {
        outF<<i<<'\n';
    }



    for (int i = k; i < n; ++i)
    {
        min_l=DBL_MAX;

        for (int j = 0; j < k; ++j)
        {
            distance[j] = s[j] * sqrt(pow((runner[j].first - comp[i].first), 2) + pow((runner[j].second - comp[i].second), 2));
        }

        for(int j = 0; j<k; ++j)
        {
            if(min_l>distance[j])
            {
                min_l=distance[j];
                idx=j;
            }
        }

        runner[idx].first=comp[i].first;
        runner[idx].second=comp[i].second;

        outF<<idx+1<<'\n';
    }

    delete[] runner;
    delete[] comp;
    delete[] s;
    delete[] distance;
}