#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+6;
const int SQ=330;
struct runner
{
    double speed;
    double x,y;
    int idx;
    bool operator<(runner const& other)const
    {
        return speed<other.speed;
    }
};
struct point
{
    double x,y;
    int idx;
    bool operator<(point const& other)const
    {
        return x-y<other.x-other.y;
        //return make_pair(x,y)<make_pair(other.x,other.y);
    }
};
bool cmp(point p1,point p2)
{
    return p1.idx<p2.idx;
}
struct solution
{
    vector<int>perm;
};

int n,k,c;
vector<runner>runners;
vector<point>comps;
mt19937 mt(69);
double eval(solution s)
{
    for(int i=0;i<runners.size();i++)
    {
        runners[s.perm[i]].x=comps[i].x;
        runners[s.perm[i]].y=comps[i].y;
    }
    double score=0.0;
    for(int i=runners.size();i<comps.size();i++)
    {
        int runner_id=i%runners.size();
        score += runners[runner_id].speed*sqrt((runners[runner_id].x-comps[i].x)*(runners[runner_id].x-comps[i].x)+(runners[runner_id].y-comps[i].y)*(runners[runner_id].y-comps[i].y));
    }
    return score;
}
//make hillclimbing for editing groups to cover
solution hillclimb(solution s)
{
    double last_score;
    last_score = eval(s);
    while((double)clock()<(double)2.0*CLOCKS_PER_SEC)
    {
        int id1=mt()%s.perm.size();
        int id2=mt()%s.perm.size();
        swap(s.perm[id1],s.perm[id2]);
        double new_score = eval(s);
        if(new_score < last_score)
        {
            last_score=new_score;
        }
        else
        {
            swap(s.perm[id1],s.perm[id2]);
        }
    }
    return s;
}
double firstX[MAXN],firstY[MAXN];
vector<point>assigned_comps1[MAXN];
vector<point>assigned_comps[MAXN];
int what[MAXN];
int group[MAXN];
point means[MAXN];
double dist_to_travel(vector<point>v)
{
    //sort(v.begin(),v.end(),cmp);
    double ans=0;
    for(int i=1;i<v.size();i++)
    {
        ans+=sqrt((v[i].x-v[i-1].x)*(v[i].x-v[i-1].x)+(v[i].y-v[i-1].y)*(v[i].y-v[i-1].y));
    }
    return ans;
}
int where[MAXN];
double curX[MAXN];
double curY[MAXN];
int whoTakesIt[MAXN];
double calc_score()
{
    for(int i=0;i<runners.size();i++)
    {
        curX[i]=firstX[i];
        curY[i]=firstY[i];
    }
    double ret=0;
    for(int i=runners.size();i<comps.size();i++)
    {
        long double mindist=(long double)2e17;
        int what=-1;
        for(int j=0;j<c;j++)
        {
            long double dist1=(long double)runners[j].speed*sqrt((long double)(curX[runners[j].idx]-comps[i].x)*(curX[runners[j].idx]-comps[i].x)+(curY[runners[j].idx]-comps[i].y)*(curY[runners[j].idx]-comps[i].y));
            if(dist1<mindist)
            {
                mindist=dist1;
                what=runners[j].idx;
            }
        }
        ret+=mindist;
        whoTakesIt[i]=what;
        curX[what]=comps[i].x;
        curY[what]=comps[i].y;
    }
    return ret;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    freopen("runners.in","r",stdin);
    freopen("runners.out","w",stdout);
    cin>>n>>k;
    for(int i=0;i<k;i++)
    {
        double s;cin>>s;
        runners.push_back({s,0,0, i});
    }
    for(int i=0;i<n;i++)
    {
        double x,y;cin>>x>>y;
        comps.push_back({x,y, i});
    }
    //sort(comps.begin(),comps.end());
    int szbucket = n/k;
    sort(runners.begin(),runners.end());
    vector<int>ids;
    for(int i=0;i<runners.size();i++)ids.push_back(i);
    shuffle(ids.begin(),ids.end(),mt);
    for(int i=0;i<runners.size();i++)
    {
        firstX[i]=comps[ids[i]].x;
        firstY[i]=comps[ids[i]].y;
        whoTakesIt[ids[i]]=i;
    }
    if(runners.size()>=10000)c=(int)1e7/comps.size();
    else if(runners.size()>=1000)c=50000000/comps.size();
    else if(runners.size()>=100)c=60000000/comps.size();
    else if(runners.size()>=10)c=70000000/comps.size();
    else c=45000000/comps.size();
    c=min(c,(int)runners.size());
    calc_score();
    for(int i=0;i<runners.size();i++)cout<<(int)firstX[i]<<" "<<(int)firstY[i]<<endl;
    for(int i=0;i<comps.size();i++)
    {
        cout<<whoTakesIt[i]+1<<endl;
    }
    /*solution s;
    for(int i=0;i<k;i++)s.perm.push_back(i);
    s=hillclimb(s);
    for(int i=0;i<k;i++)
    {
        firstX[s.perm[i]]=comps[i].x;
        firstY[s.perm[i]]=comps[i].y;
    }
    for(int i=0;i<k;i++)cout<<int(firstX[i])<<" "<<int(firstY[i])<<endl;
    for(int i=0;i<n;i++)
    {
        cout<<s.perm[i%k]+1<<endl;
    }*/
return 0;
}