#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 main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, x;
  cin >> n >> x;
  long long a[n];
  map<long long, long long> mp;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    if (x == 1) {
      cout << i + 1 << endl;
    } else {
      mp[a[i] % x]++;
      long long y = (i + x) / x, z = 0;
      bool f = 1;
      for (long long j = 0; j <= min(i, x - 1); j++) {
        if (mp[j] < y) {
          z = j;
          f = 0;
          break;
        }
      }
      if (f) {
        cout << i + 1 << endl;
      } else {
        long long g = x * (mp[z] + 1);
        g = (g - (x - z));
        cout << g << endl;
      }
    }
  }
}
