#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i < h; i += g)
#define jloop_(m, h, g) for (auto j = m; j < h; j += g)
#define kloop_(m, h, g) for (auto k = m; k < h; k += g)
#define lloop_(m, h, g) for (auto l = m; l < h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t, m, n;
cin >> t >> m >> n;
pll a[n];
iloop(0, n) {cin >> a[i].first; a[i].first--; a[i].second = i+1;}
sort(a, a+n);
ll lb = 1, ub = n, mid, cptr;
vector<ll> use[t];
while (ub > lb) {
mid = (lb + ub)>>1;
iloop(0, t) use[i].clear();
cptr = 0;
iloop(0, t) {
while ((ll)use[i].size() < mid && cptr < n && a[cptr].first <= i && a[cptr].first + m >= i) {
use[i].push_back(a[cptr].second);
cptr++;
}
}
if (cptr == n) ub = mid;
else lb = mid + 1;
}
mid = lb;
iloop(0, t) use[i].clear();
cptr = 0;
iloop(0, t) {
while ((ll)use[i].size() < mid && cptr < n && a[cptr].first <= i && a[cptr].first + m >= i) {
use[i].push_back(a[cptr].second);
cptr++;
}
}
cout << mid << "\n";
iloop(0, t) {
for (auto it : use[i]) cout << it << " ";
cout << "0\n";
}
}
