#include <iostream>
#include <fstream>
#include <bits/stdc++.h>

using namespace std;

int T[4 * 1000000];

void init(int b, int e, int nodo)
{
    int mid = (b + e) / 2, L = 2 * nodo + 1, R = L + 1;
    if (b == e) T[nodo] = 1;
    else
    {
        init(b, mid, L);
        init(mid + 1, e, R);
        T[nodo] = T[L] + T[R];
    }
}

void query(int b, int e, int nodo, int k)
{
    int mid = (b + e) / 2, L = 2 * nodo + 1, R = L + 1;
    if (b == e)
    {
        cout << b + 1 << endl;
        T[nodo] = 0;
    }
    else
    {
        if (T[L] >= k) query(b, mid, L, k);
        else query(mid + 1, e, R, k - T[L]);
        T[nodo] = T[L] + T[R];
    }
}

int main()
{
    //ofstream fcin("in.txt", std::ofstream::out);
    //freopen("out.txt", "w", stdout);
    //srand( time (NULL));
    int n;
    cin >> n;
    //fcin << n << " ";
    init(0, n - 1, 0);
    int m;
    cin >> m;
    //fcin << m << endl;
    while (m--)
    {
        int k;
        cin >> k;
        //k = rand() % T[0] + 1;
        //fcin << k << endl;
        query(0, n - 1, 0, k);
    }
    return 0;
}