1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdlib>
 4 #include <cstdio>
 5 #include <cmath>
 6 #include <cctype>
 7 #include <algorithm>
 8 #include <numeric>
 9 #include <climits>
10 #include <vector>
11 #include <string>
12 using namespace std;
13
14 const int maxn =  200000 + 10;
15 int maxv[maxn << 2];
16
17 void PushUp (int rt) {
18     maxv[rt] = max (maxv[rt * 2], maxv[rt * 2 + 1] );
19 }
20
21 void build (int w, int l, int r, int rt) {
22     maxv[rt] = w;
23     if (l == r) {
24         return ;
25     }
26     int m = (l + r) / 2;
27     build (w, l, m, rt * 2);
28     build (w, m + 1, r, rt * 2 + 1);
29 }
30
31 int query (int x, int l, int r, int rt) {
32     if (r == l) {
33         maxv[rt] -= x;
34         return l;
35     }
36     int m = (l + r) / 2;
37     int ret;
38     if (maxv[rt * 2] >= x) {
39         ret = query (x, l, m, rt * 2);
40     } else {
41         ret = query (x, m + 1, r, rt * 2 + 1);
42     }
43     PushUp(rt);
44     return ret;
45 }
46
47 int main () {
48     int h, w, n;
49
50     while (~scanf ("%d %d %d", &h, &w, &n)) {
51         if (h > n) {
52             h = n;
53         }
54         build (w, 1, h, 1);
55         while (n --) {
56             int x; scanf ("%d", &x);
57             if (maxv[1] < x) {
58                 printf ("%d\n", -1);
59             } else {
60                 printf ("%d\n", query (x, 1, h, 1));
61             }
62         }
63     }
64     return 0;
65 }