#include <bits/stdc++.h>
#define int long long
#define Node pair<long long,long long>
using namespace std;
const int MN=1e6+116;
int n, m, a[MN], ans[MN];
priority_queue <Node,vector<Node>,greater<Node>> q;
bool check(int x){
    int t=m;
    for(int i=1; i<=n; ++i){
        t-=x/a[i];
        if(t<0) return false;
    }
    return true;
}
signed main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin>>m>>n; int l=0, r=0, res;
	for(int i=1; i<=n; ++i){cin>>a[i]; r=max(r,a[i]);}
	l=r+1, r*=m;
	while(l<=r){
		int mid=(l+r)>>1;
		if(check(mid)){
			res=mid;
			l=mid+1;
		}else{
			r=mid-1;
		}
	}
	int minr=res;
	for(int i=1; i<=n; ++i){
		minr=min(minr,max((int)0,(res/a[i]-1)*a[i]));
	}
	int now=0;
	for(int i=1; i<=n; ++i){
		now+=minr/a[i];
		q.push({minr/a[i]*a[i],i});
	}
	while(now<m){
		Node t=q.top(); q.pop();
		ans[t.second]=++now;
		t.first+=a[t.second];
		q.push(t);
	}
	for(int i=1; i<=n; ++i) cout<<ans[i]<<' ';
	return 0;
}