#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl '\n'
#define ff first
#define ss second
#define stop exit(0)
#define sz(x) (int)x.size()
#define pause system("pause")
#define all(x) (x).begin(), (x).end()
#define deb(x) cout << #x << "-" << x << endl
typedef char chr;
typedef string str;
typedef long long ll;
typedef vector<int> vii;
typedef pair<int, int> pii;
const long long INF = LLONG_MAX;
const int inf = INT_MAX;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};
const double PI = 2 * acos(0.0);
const int N = 2e6 + 5;
int n, d, m, ans;
int a[N];
vector<pii> v;
bool check(int x) {
vector<int> fix(n+1, 0);
int cur = 1;
for (auto [y, i] : v) {
if (cur < y) {
cur = y;
}
if (fix[cur] >= x) {
cur++;
}
if (cur-y > d) {
return false;
}
if (cur > n) {
return false;
}
fix[cur]++;
}
return true;
}
void printshedule(int x) {
vector<int> fix(n+1, 0);
int cur = 1;
for (auto [y, i] : v) {
if (cur > y) {
cur = y;
for (int i = cur; i <= y-1; i++) {
cout << 0 << endl;
}
}
if (fix[cur] >= x) {
cur++;
cout << 0 << endl;
}
fix[cur]++;
cout << i << " ";
}
cout << 0 << endl;
for (int i = cur+1; i <= n; i++) {
cout << 0 << endl;
}
}
inline void test_case() {
cin >> n >> d >> m;
for (int i = 1; i <= m; i++) {
cin >> a[i];
v.pb(mp(a[i],i));
}
sort(all(v));
int l = 0; int r = m;
while (l <= r) {
int mid = (l+r)/2;
if (check(mid)) {
ans = mid;
r = mid - 1;
} else {
l = mid + 1;
}
}
cout << ans << endl;
printshedule(ans);
return;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int T = 1;
// cin >> T;
while (T--) {
test_case();
}
return 0;
}
