#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>

using namespace std;
int a[1000005],b[1000005];
int n,q;
int h;
int main(){
	cin>>n>>q;
	a[0]=0;
	for(int i=1;i<=n;i++){
		a[i]=a[i-1]+1;
		cin>>b[i];
	}
	int o=max(n,q);
	for(int i=1;i<=o;i++){
		for(int j=1;j<=o;j++){
			if(a[j]==b[i]){
				h=j;
			}
		}
		int w=h;
		w++;
		int e=h;
		e--;
		if(h==n){
			swap(a[h],a[e]);
		}else{
			swap(a[h],a[w]);
		}
		
	}
	for(int i=1;i<=n;i++){
				cout<<a[i]<<" ";
			}
			cout<<endl;
	return 0;
}