#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, const T &b) {
  return b > a ? a = b, true : false;
}
template <class T>
inline bool chmin(T &a, const T &b) {
  return b < a ? a = b, true : false;
}
template <class T>
using MaxHeap = priority_queue<T>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>>
void sort_uniq(vector<T> &v, F f = F()) {
  sort(begin(v), end(v), f);
  v.resize(unique(begin(v), end(v)) - begin(v));
}
const int N = 4e5 + 5;
int cnt[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int qq, x;
  cin >> qq >> x;
  int ans = 0;
  for (int q = 0; q < (int)(qq); q++) {
    int a;
    cin >> a;
    cnt[a % x]++;
    while (cnt[ans % x]) {
      cnt[ans % x]--;
      ans++;
    }
    cout << ans << '\n';
  }
  return 0;
}
