#include <bits/stdc++.h>
using namespace std;
long long fac[10000000];
long long gcd(long long x, long long y) {
  if (y == 0) return 0;
  return gcd(y, x % y) + x / y;
}
long long fexp(long long a, long long b, long long m) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % m;
    b /= 2;
    a = a * a % m;
  }
  return ans;
}
long long inverse(long long a, long long p) { return fexp(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
  if (r == 0) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
vector<long long> z(string s) {
  long long n = s.size();
  vector<long long> z(n);
  long long x = 0, y = 0, p = 0;
  for (long long i = 1; i < n; i++) {
    z[i] = max(p, min(z[i - x], y - i + 1));
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) {
      x = i;
      y = i + z[i];
      z[i]++;
    }
  }
  return z;
}
void subset(long long a[], long long k) {
  for (int i = 1; i < pow(2, k); i++) {
    long long x = 0;
    for (int j = 0; j < k; j++) {
      if (i & 1 << j) {
        cout << a[j] << " ";
      }
    }
    cout << endl;
  }
}
vector<long long> pr(string s) {
  long long n = s.length();
  vector<long long> pi(n);
  for (int i = 1; i < n; i++) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) j++;
    pi[i] = j;
  }
  return pi;
}
int q, x, v, pos, a[400005];
void solve() {
  scanf("%d%d", &q, &x);
  while (q--) {
    scanf("%d", &v);
    ++a[v % x];
    while (a[pos % x] > pos / x) ++pos;
    printf("%d\n", pos);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
