pata1056

#include<iostream> 
#include<queue>
using namespace std;
const int maxn=1010;
struct node{
	int weight;
	int rank;
}_node[maxn];
int main()
{
	#ifdef ONLINE_JUDGE  
    #else  
    freopen("in.txt","r",stdin);  
    freopen("out.txt","w",stdout);  
    #endif 
	int np,ng;
	cin>>np>>ng;
	for(int i=0;i<np;i++){
		int _weight=0;
		cin>>_weight;
		_node[i].weight=_weight;
	}
	queue<int> qq;
	for(int i=0;i<np;i++){
		int r;
		cin>>r;
		qq.push(r);
	}
	int group=0;
	while(qq.size()!=1){
		if(qq.size()%ng==0){
			group=qq.size()/ng;
		}else{
			group=qq.size()/ng+1;
		}
		int now=qq.size();
		//cout<<now<<endl;
		for(int i=0;i<group;i++){
			int maxweight=qq.front();
			for(int j=0;j<ng;j++){
				if(i*ng+j>=now){//注意这里j从0开始的话要带上等号 
					break;
				}
				if(_node[maxweight].weight<_node[qq.front()].weight){
					maxweight=qq.front();
				}
				_node[qq.front()].rank=group+1;
				qq.pop();
			}
			//cout<<maxweight<<' ';
			qq.push(maxweight);
		}
		//cout<<endl;
	}
	_node[qq.front()].rank=1;
	for(int i=0;i<np-1;i++){
		cout<<_node[i].rank<<' ';
	}
	cout<<_node[np-1].rank<<endl;
	return 0;
}