#include<vector>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<map>
#include<set>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
using namespace std;

struct 
{
    int num;
    int weight;
    int ran;
}mice[1010];

queue<mouse> q;

int getGroup(int np,int ng)
{
    int group;
    int t=np%ng;
    if(t==0)
    {
        group=np/ng;
    }
    else group=np/ng+1;
    return group;
}
int main()
{
    int np,ng;
    scanf("%d%d",&np,&ng);
    for(int i=0;i<np;i++)
    {
        scanf("%d",&mice[i].weight);
        mice[i].num=i;
    }
    int temp;
    for(int i=0;i<np;i++)
    {
        scanf("%d",&temp);
        q.push(mice[temp]);
    }
    mouse tempMouse;
    while(q.size()!=1)
    {
        queue<mouse> tempQueue;
        int group=getGroup(q.size(),ng);
        for(int i=0;i<group;i++)
        {
            int maxWeight=-1;
            int maxNum=-1;
            for(int j=0;j<ng;j++)
            {
                tempMouse=q.front();
                q.pop();
                if(tempMouse.weight>maxWeight)
                {
                    maxWeight=tempMouse.weight;
                    maxNum=tempMouse.num;
                }
                mice[tempMouse.num].ran=group+1;
            }
            tempQueue.push(mice[maxNum]);
        }
        q=tempQueue;
    }
    tempMouse=q.front();
    mice[tempMouse.num].ran=1;
    for(int i=0;i<np-1;i++)
    {
        printf("%d ",mice[i].ran);
    }
    printf("%dn",mice[np-1].ran);
    return 0;
}