#include <iostream>

 #include <algorithm>

 #include <map>

 #include <queue>

 #include <string>

 #include <stack>

 #include <vector>

 #include <list>

 #include <cstdio>

 #include <cstring>

 #include <cmath>

 using namespace std;

 #define ll long long

 #define pb push_back

 #define fi first

 #define se second

 const int N = 2e5+;

 int a[N],c[N];

 int n,h,w;

 inline int lb(int x){

     return x&(-x);

 }

 void update(int inx){

     for(int i = inx; i <= h; i += lb(i)){

         c[i] = a[i];

         int d = lb(i);

         if(d == ) continue;

         for(int j = ; j < d; j <<= )

             c[i] = max(c[i], c[i-j]);

     }

 }

 inline bool fun(int& l,int& r,int it){

     while(r <= h){

      //   cout << "fun" << endl;

         if(c[r] < it){

             l = r;

             r += lb(r);

             if(r > h) r = l+;//要遍历所有的分块区间

         }

         else return ;

     }

     return ;

 }

 void solve(){

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

         h = h >= n ? n : h;

         for(int i = ; i <= h; ++i) a[i] = c[i] = w;//初始化

         int it;

         for(int p = ; p <= n; ++p){

             scanf("%d",&it);

             int l = ,r = ,ok = ;

             while(fun(l,r,it)){//找是否有满足的区间

                // cout << "main" << endl;

                 ok = ;

                 if(l == r){

                     printf("%d\n",l);

                     a[l] -= it;

                     update(l);

                     break;

                 }

                 else r = ++l;//缩小区间

             }

             if(!ok) printf("-1\n");

         }

     }

 }

 int main(){

   //  ios::sync_with_stdio(false);

   //  cin.tie(0); cout.tie(0);

     solve();

     return ;

 }