#include<bits/stdc++.h>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll,ll);
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B);
mat pow(mat A,ll n);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};


bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}

ll gcd(ll a,ll b){
  if(b == 0)return a;
  else return gcd(b,a%b);
}

ll bpow(ll a, ll n,ll mod){
  int i = 0;
  ll res=1;
  while(n){
    if(n & 1)
      res = (res*a) % mod;
    a = (a*a) % mod;
    n >>= 1;
  }
  return res;
}

int main()
{
  ll N,NN,K;
  cin >> N >> K;
  NN = N;
  if(N%(K+1) == 1){
    cout << 0 << endl;
  }else{
    int d = N%(K+1);
    if(d == 0){
      cout << K << endl;
      N-=K;
    }else{
      cout << d-1 << endl;
      N-= d-1;
    }
  }
  int L;
  while(1){
    cin >> L;
    if(L >= NN)
      return 0;
    N-=L;
    int d = N%(K+1);
    if(d == 0){
      cout << K << endl;
      N-=K;
    }else{
      cout << d-1 << endl;
      N -= d-1;
    }
  }
  return 0;
}