#include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <fstream>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 using namespace std;

 #define fr first

 #define sc second

 #define pb(a) push_back(a)

 #define Rint(a) scanf("%d", &a)

 #define Rll(a) scanf("%I64d", &a)

 #define Rs(a) scanf("%s", a)

 #define Fread() freopen("in", "r", stdin)

 #define Fwrite() freopen("out", "w", stdout)

 #define Rep(i, n) for(int i = 0; i < (n); i++)

 #define For(i, a, n) for(int i = (a); i < (n); i++)

 #define Cls(a) memset((a), 0, sizeof(a))

 #define Full(a) memset((a), 0w7f7f, sizeof(a))

 #define lrt rt << 1

 #define rrt rt << 1 | 1

 const int mawn = ;

 int sum[mawn<<];

 int w, h, n, t;

 void pushUP(int rt) {

     sum[rt] = max(sum[lrt], sum[rrt]);

 }

 void build(int l, int r, int rt) {

     sum[rt] = w;

     if(l == r) return;

     int m = (l + r) >> ;

     build(l, m ,lrt);

     build(m+, r, rrt);

     // pushUP(rt);

 }

 void update(int p, int w, int l, int r, int rt) {

     if(l == r) {

         sum[rt] -= w;

         return;

     }

     int m = (l + r) >> ;

     if(p <= m) update(p, w, l, m, lrt);

     else update(p, w, m+, r, rrt);

     pushUP(rt);

 }

 int query(int l, int r, int rt, int w) {

     if(l == r) {

         sum[rt] -= w;

         // update(l, w, 1, n, 1);

         return l;

     }

     int m = (l + r) >> ;

     int ret = sum[rt<<] >= w ? query(l, m, lrt, w) : query(m+, r, rrt, w);

     pushUP(rt);

     return ret;

 }

 int main() {

     // Fread();

     while(~scanf("%d%d%d", &h, &w, &n)) {

         h = min(h, n);

         build(, h, );

         while(n--) {

             Rint(t);

             if(sum[] < t) printf("-1\n");

             else printf("%d\n", query(, h, , t));

         }

     }

     return ;

 }