#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
using namespace std;

int n,k;
struct man{
	int w;	//权值，要按这个排序 
	int d;	//序号
	int c;	//类别序号
	int num; //编号 

}people[20005];

int e[11];

bool cmp(man i,man j){
	return i.w>j.w;
}

int main(){
	cin>>n>>k;
	for(int i=1;i<=10;i++)
		cin>>e[i];
	for(int i=1;i<=n;i++){
		cin>>people[i].w;
		people[i].num=i;
	}
	

	sort(people+1,people+1+n,cmp);

	
	for(int i=1;i<=n;i++){
		people[i].d=i;
		people[i].c=(people[i].d-1)%10 +1;
		people[i].w+=e[people[i].c];
	}

	for(int i=1;i<=k;i++)
	cout<<people[i].num<<" ";

	
}