#include <bits/stdc++.h>
using namespace std;
bool check(vector<pair<int,int>> &allJobs, int currNr, int delay, int days)
{
if (currNr == 0)
{
return false;
}
vector<int> busy(days+1);
for (int i = 0; i < allJobs.size(); i++)
{
int day = allJobs[i].first;
while(day < days + 1 && busy[day] >= currNr)
{
day++;
}
if (day >= days + 1)
{
return false;
}
if (allJobs[i].second + delay < day)
{
return false;
}
else
{
busy[day]++;
}
}
return true;
}
void print(vector<pair<int,int>> &allJobs, int days, int nr)
{
vector<vector<int>> busy(days+1);
for (int i = 0; i < allJobs.size(); i++)
{
int day = allJobs[i].first;
while(busy[day].size() >= nr)
{
day++;
}
busy[day].push_back(allJobs[i].second);
}
for (int i = 1; i <= days; i++)
{
for (auto j: busy[i])
{
cout << j << " ";
}
cout << 0 << "\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, d, m;
cin >> n >> d >> m;
vector<pair<int,int>> allJobs;
for (int i = 0; i < m; i++)
{
int x;
cin >> x;
allJobs.push_back({x, i+1});
}
for (int i = 1; i <= m; i++)
{
if (check(allJobs, i, d, n))
{
cout << i << "\n";
print(allJobs, n, i);
return 0;
}
}
/* int left = 0;
int right = m;
while(left <= right)
{
int mid = (left + right) >> 1;
if (check(allJobs, mid, d, n))
{
right = mid - 1;
}
else
{
left = mid + 1;
}
}
int mid = (left+right) >> 1;
if (mid >= 2 && check(allJobs, mid-1, d, n))
{
cout << mid - 1 << "\n";
print(allJobs, n, mid-1);
}
else if (check(allJobs, mid, d, n))
{
cout << mid << "\n";
print(allJobs, n, mid);
}
else if (check(allJobs, mid + 1, d, n))
{
cout << mid + 1 << "\n";
print(allJobs, n, mid + 1);
}
else
{
cout << mid + 2 << "\n";
print(allJobs, n, mid + 2);
}*/
}
