#include<queue>
#include<iostream>
using namespace std;
queue <int> q[110];
priority_queue <pair<int, int> > pq;
int main(){
	int n, m, i, a, b, c;
	scanf("%d", &m);
	scanf("%d", &n);
	pq.push({0,-1});
	pq.push({0,-2});
	pq.push({0,-3});
	for(i=1;i<=n;i++){
		scanf("%d", &a);
		b = pq.top().first;
		c = pq.top().second;
		pq.pop();
		pq.push({b-a,c});
		q[-c].push(i);
	}
	for(i=1;i<=m;i++){
		while(!q[i].empty()){
			printf("%d ", q[i].front());
			q[i].pop();
		}
		printf("\n");
	}
}