#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
template <typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
  for (auto i : v) os << i << " ";
  return os;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
  long long n = v.size();
  for (long long i = (0); i < (long long)(n); i++) {
    long long a;
    cin >> a;
    v[i] = a;
  }
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, set<T>& second) {
  for (auto i : second) os << i << " ";
  return os;
}
long long mystoi(string str) {
  stringstream ss(str);
  long long ans = 0;
  ss >> ans;
  return ans;
}
long long exp(long long x, long long ex) {
  long long ans = 1ll;
  while (ex > 0) {
    if (ex & 1ll) ans = (ans * x);
    ex >>= 1ll;
    x = (x * x);
  }
  return ans;
}
struct cmp {
  bool operator()(const pair<long long, long long>& a,
                  const pair<long long, long long>& b) const {
    if (a.first == b.first) return a.second < b.second;
    return a.first < b.first;
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    long long q, x;
    cin >> q >> x;
    set<pair<long long, long long>, cmp> second;
    for (long long i = (0); i < (long long)(x); i++) second.insert({0, i});
    long long cnt[x];
    memset(cnt, 0, sizeof(cnt));
    for (long long i = (0); i < (long long)(q); i++) {
      long long a;
      cin >> a;
      a %= x;
      pair<long long, long long> p;
      p.first = cnt[a];
      p.second = a;
      auto it = second.find(p);
      second.erase(it);
      second.insert({p.first + 1, p.second});
      cnt[a]++;
      cout << (*second.begin()).first * x + (*second.begin()).second << endl;
    }
  }
}
