#include <bits/stdc++.h>
const int mod = 1e9 + 7;
using namespace std;
using namespace std;
const int maxn = 2e5 + 55;
const int MAX = 2e5 + 55;
int days[maxn], n, m, d;
pair<int, int> v[maxn], sg[4 * maxn];
inline pair<int, int> operator+(pair<int, int> a, pair<int, int> b) {
  if (a.first < b.first) return a;
  return b;
}
inline void build(int node, int l, int r) {
  if (l == r) {
    sg[node] = {0x3f3f3f3f, 0x3f3f3f3f};
    return;
  }
  build((node << 1), l, l + ((r - l) >> 1));
  build(((node << 1) | 1), l + ((r - l) >> 1) + 1, r);
  sg[node] = sg[(node << 1)] + sg[((node << 1) | 1)];
}
inline void update(int node, int l, int r, int idx, int val) {
  if (idx < l or idx > r) return;
  if (idx == l and l == r) {
    sg[node] = {val, idx};
    return;
  }
  update((node << 1), l, l + ((r - l) >> 1), idx, val);
  update(((node << 1) | 1), l + ((r - l) >> 1) + 1, r, idx, val);
  sg[node] = sg[(node << 1)] + sg[((node << 1) | 1)];
}
inline pair<int, int> query(int node, int l, int r, int i, int j) {
  if (i > r or j < l) return {0x3f3f3f3f, -1};
  if (i <= l and j >= r) return sg[node];
  return query((node << 1), l, l + ((r - l) >> 1), i, j) +
         query(((node << 1) | 1), l + ((r - l) >> 1) + 1, r, i, j);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m >> d;
  build(1, 0, n);
  for (int i = 0; i < n; i++) cin >> v[i].first, v[i].second = i;
  sort(v, v + n);
  update(1, 0, n, 0, v[0].first);
  days[v[0].second] = 1;
  int _size = 1;
  for (int i = 1; i < n; i++) {
    int a = v[i].first;
    pair<int, int> item = query(1, 0, n, 0, n);
    if (a - d <= item.first) {
      ++_size;
      update(1, 0, n, _size - 1, a);
      days[v[i].second] = _size;
    } else {
      update(1, 0, n, item.second, a);
      days[v[i].second] = item.second + 1;
    }
  }
  cout << _size << '\n';
  for (int i = 0; i < n; i++) cout << days[i] << ' ';
  cout << '\n';
}
