#include <bits/stdc++.h>
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
  uniform_int_distribution<int> uid(0, lim - 1);
  return uid(rang);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
vector<int> g[N];
int a[N];
void solve() {
  long long i, j, n, x, data, f = 1;
  cin >> n >> x;
  vector<long long> req;
  for (i = 0; i < x; i++) {
    req.push_back(i);
  }
  map<long long, long long> m;
  multiset<long long> ms;
  long long curr_max = 0;
  long long need = 0;
  while (n--) {
    cin >> data;
    m[data % x]++;
    if (m[data % x] > 1) {
      req[data % x] = req[data % x] + x;
    }
    long long maxi = req[data % x];
    curr_max = max(maxi, curr_max);
    ms.insert(maxi);
    auto it1 = ms.upper_bound(need);
    if (it1 != ms.begin()) {
      it1--;
    }
    auto it2 = ms.upper_bound(need);
    if (it2 == ms.end()) {
      need++;
      cout << need << "\n";
      continue;
    } else if (*it2 - *it1 == 1) {
      need = curr_max + 1;
      cout << need << "\n";
    } else if (*it1 == need) {
      need++;
      cout << need << "\n";
    } else {
      cout << need << "\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
int mpow(int base, int exp) {
  base %= mod;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long)result * base) % mod;
    base = ((long long)base * base) % mod;
    exp >>= 1;
  }
  return result;
}
void ipgraph(int n, int m) {
  int i, u, v;
  while (m--) {
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
}
void dfs(int u, int par) {
  for (int v : g[u]) {
    if (v == par) continue;
    dfs(v, u);
  }
}
