#include <iostream>
using namespace std;
const int N = 100010 * 64;
typedef long long ll;
int tr[N];
int lp[N];
int rp[N];
int lastn = 2;
ll getk(int &cur, ll l, ll r, ll k)
{
	if (cur == 0) cur = lastn++;
	tr[cur]++;
	if (l == r)
		return l;
	ll m = (l + r) / 2;
	ll lsize = m - l + 1 - tr[lp[cur]];
	if (lsize >= k)
		return getk(lp[cur], l, m, k);
	else
		return getk(rp[cur], m + 1, r, k - lsize);
}
int root = 1;
int main()
{
	ios::sync_with_stdio(false);
	ll n, k;
	cin >> n >> k;
	ll p = 0;
	for (int i = 0; i < k; ++i){
		ll x;
		cin >> x;
		p = (p + x - 1) % (n - i) + 1;
		ll res = getk(root, 1, n, p);
		cout << res << ' ';
		--p;
	}
	cout << '\n';
	return 0;
}