#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using P=pair<ll,ll>;
typedef atcoder::modint mint;
ll inf=9e18;
template<typename T, int s, int i = 0>
auto vec(const ll (&sizes)[s], const T& init = T()){
  if constexpr(i < s) return vector(sizes[i], vec<T, s, i+1>(sizes, init));
  else return init;
}


int main(){
  ll k,n;
  cin>>k>>n;
  auto v=vec<ll>({k+1},0);
  for(ll i=1;i<=k;i++){
    cin>>v[i];
  }
  for(ll i=0;i<k;i++){
    v[i+1]+=v[i];
  }
  for(ll i=1;i<=k;i++){
    ll ans=inf;
    // cout<<v[i-1]<<" "<<(v[i-1]-1)%n+1<<" "<<i-1<<"\n";
    if(i!=1&&v[i-1]-((v[i-1]-1)%n+1)>=i-1){
      ans=min(ans,(v[i-1]-1)%n+1);
    }
    // cout<<v[k]<<" "<<v[i]<<" "<<n-(v[i]+n-1)%n<<" "<<k-i<<"\n";
    if(i!=k&&v[k]-v[i]-(n-(v[i]+n-1)%n)>=k-i){
      ans=min(ans,n-(v[i]-1)%n);
    }
    if(ans==inf) cout<<"-1\n";
    else cout<<ans<<"\n";
  }
}