#include<bits/stdc++.h>
using namespace std;
double s[100050];
struct point
{
    int x,y,i;
} a[100050];
bool cmp(point p, point q)
{
    if(p.x==q.x) return p.y<q.y;
    return p.x<q.x;
}
int otg[100050];
int main()
{
    freopen("runners.in","r",stdin);
    freopen("runners.out","w",stdout);
    int n,k;
    cin>>n>>k;
    double mini=2e9;
    int ind=0;
    for(int i=0; i<k; i++)
    {
        cin>>s[i];
        if(s[i]<mini)
        {
            mini=s[i];
            ind=i;
        }
    }
    for(int i=0; i<n; i++)
    {
        cin>>a[i].x>>a[i].y;
        a[i].i=i;
    }
    sort(a,a+n,cmp);
    for(int i=0; i<k; i++)
    {
        if(i==ind)
        {
            cout<<a[k-1].x<<" "<<a[k-1].y<<endl;
        }
        else if(i==k-1)
        {
            cout<<a[ind].x<<" "<<a[ind].y<<endl;
        }
        else cout<<a[i].x<<" "<<a[i].y<<endl;
    }
    for(int i=0; i<n; i++)
    {
        if(i<k)
        {
            if(i==ind)
            {
                otg[a[k-1].i]=ind+1;
            }
            else if(i==k-1)
            {
                otg[a[ind].i]=k;
            }
            else otg[a[i].i]=i+1;
        }
        else otg[a[i].i]=ind+1;
    }
    for(int i=0;i<n;i++)
    {
        cout<<otg[i]<<endl;
    }
}