#include<iostream>
#include<vector>
#include<algorithm>
#include<tuple>
#include<cmath>
using namespace std;

const int MAXK=1e5, MAXN=1e5, MAXD=1e9;

double s[MAXK];
pair<int, int> c[MAXN];

pair<int, int> pos[MAXK];
vector<int> ans;

vector<tuple<int, int, int> > currPos;
vector<pair<int, int> > workers;

void ClearData()
{
    workers.clear();
    currPos.clear();
    ans.clear();
}

pair<int, int> GetNaiveResult(int p, double t, int cIdx, int n, int k, double cost)
{
    if(cIdx==n)
    {
        return {p, t};
    }

    double minCost=sqrt(2)*10*MAXD;
    int minIdx=-1;
    for(int i=0; i<currPos.size(); i++)
    {
        int idx, x, y;
        tie(idx, x, y)=currPos[i];

        double currCost=s[idx]*sqrt(abs(x-c[cIdx].first)*abs(x-c[cIdx].first)+abs(y-c[cIdx].second)*abs(y-c[cIdx].second));
        if(currCost<minCost)
        {
            minCost=currCost;
            minIdx=i;
        }
    }

    if(minIdx==-1 || minCost>cost)
    {
        if(p<k)
        {
            currPos.push_back(make_tuple(workers[p].second, c[cIdx].first, c[cIdx].second));
            pos[p]=c[cIdx];
            ans.push_back(workers[p].second);
        }
        else
        {
            return {k+1, t};
        }

        p++;
        t+=cost;
    }
    else
    {
        currPos[minIdx]=make_tuple(get<0>(currPos[minIdx]), c[cIdx].first, c[cIdx].second);
        t+=minCost;
        ans.push_back(workers[minIdx].second);
    }

    return GetNaiveResult(p, t, cIdx+1, n, k, cost);
}

void Solve(int n, int k)
{
    for(int i=0; i<k; i++)
    {
        workers.push_back({s[i], i});
    }
    sort(workers.rbegin(), workers.rend());

    double l=0, r=sqrt(2)*MAXD, ans=r, offset=0.001;
    while(r-l>offset)
    {
        double mid=l+(r-l)/2;

        int p; double t;
        ClearData();
        tie(p, t)=GetNaiveResult(0, 0, 0, n, k, mid);

        if(p<=k)
        {
            if(p==k)
            {
                ans=t;
            }

            r=mid;
        }
        else
        {
            l=mid;
        }
    }

    ClearData();
    GetNaiveResult(0, 0, 0, n, k, ans);
}

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

    freopen("runners.in", "r", stdin);
    freopen("runners.out", "w", stdout);

    int n, k;
    cin >> n >> k;

    for(int i=0; i<k; i++)
    {
        cin >> s[i];
    }

    for(int i=0; i<n; i++)
    {
        cin >> c[i].first >> c[i].second;
    }

    Solve(n, k);

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

    for(int i=0; i<n; i++)
    {
        cout << ans[i]+1 << "\n";
    }

    return 0;
}