#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define LL long long
#define lowbit(x) ((x) & (-x))
const int MAXN = 2e5 + 10;
const int INF = 0x3f3f3f3f;
 
struct SEG
{
    int l, r, wMax;
}segT[MAXN << 2];
 
int w;
 
int PushUp(int cur)
{
    segT[cur].wMax = max(segT[cur << 1].wMax, segT[cur << 1 | 1].wMax);
}
 
int GetMid(int m, int n)
{
    return m + ((n - m) >> 1);
}
 
void Build(int cur, int l, int r)
{
    segT[cur].l = l, segT[cur].r = r;
    if (l == r)
    {
        segT[cur].wMax = w;
        return;
    }
    int mid = GetMid(l, r);
    Build(cur << 1, l, mid);
    Build(cur << 1 | 1, mid + 1, r);
    PushUp(cur);
}
 
int Query(int cur, int val)
{
    if (segT[cur].wMax < val)
        return -1;
    if (segT[cur].l == segT[cur].r)
    {
        segT[cur].wMax -= val;
        return segT[cur].l;
    }
    int mid = GetMid(segT[cur].l, segT[cur].r);
    int ans = 0;
    if (segT[cur << 1].wMax >= val)
        ans = Query(cur << 1, val);
    else
        ans = Query(cur << 1 | 1, val);
    PushUp(cur);
    return ans;
}
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int h, n, i, j, a;
    while (~scanf("%d%d%d", &h, &w, &n))
    {
        Build(1, 1, min(n, h));
        while (n--)
        {
            scanf("%d", &a);
            printf("%d\n", Query(1, a));
        }
    }
    return 0;
}