#include<bits/stdc++.h>
using namespace std;
int order[103][13][13];//第几个学校第几队第几个人,数组值为编号
int teamNum[103]={0};//下标为学校,数组值为队伍数
int main()
{
memset(order,0,sizeof(order));
int school;
cin>>school;
int maxn=0;
for(int i=1;i<=school;i++){
int team;
cin>>team;
teamNum[i] = team;
maxn = max(maxn,team);
}
int num=1;//编号
int lastSchool=0;
//循环编号,最里面是学校,第二层循环是同一队的人,第三层循环是队伍
for(int team=1;team<=maxn;team++){
for(int people=1;people<=10;people++){
for(int nowSchool=1;nowSchool<=school;nowSchool++){
if(team<=teamNum[nowSchool]){//队伍还没分配完
if(lastSchool==nowSchool)
//因为每次循环nowSchool都会+1,但是如果只有一个学校,只有那个学校才能进入循环修改lastSchool,
//这样就只需要看lastSchool是否保持不变判断是否只有一个学校
num++;
order[nowSchool][team][people] = num;
num++;
lastSchool = nowSchool;
}
}
}
}
for(int i=1;i<=school;i++){
cout<<"#"<<i<<endl;
for(int j=1;j<=teamNum[i];j++){
for(int k=1;k<=10;k++){
cout<<order[i][j][k]<<" ";
}
cout<<endl;
}
}
return 0;
}