1 #include<bits/stdc++.h>
 2 using namespace std;
 3 struct P {
 4     int s[20][15], l = 0, ok = 0;
 5     int idx = -1;
 6 }arr[110];
 7 int shu = 1, endarr;
 8 void Tow(P &a) {
 9
10     while (a.l - a.ok>0) {
11         a.idx++;
12         a.s[a.ok][a.idx] = shu;
13         shu += 2;
14         if (a.idx == 9) {
15             a.idx = -1;
16             a.ok++;
17         }
18     }
19 }
20 int n;
21 int main()
22 {
23     //freopen("in.txt", "r", stdin);
24     scanf("%d", &n);
25     for (int i = 0; i < n; i++)
26         scanf("%d", &(arr[i].l));
27     bool f = true;
28     if (n <= 1) f = false;
29     int t = n;
30     while (f)
31     {
32         for (int i = 0; i < n; i++) {
33             if (arr[i].l - arr[i].ok>0) {
34                 arr[i].idx++;
35                 arr[i].s[arr[i].ok][arr[i].idx] = shu++;
36                 if (arr[i].idx == 9) {
37                     arr[i].idx = -1;
38                     arr[i].ok++;
39                     if (arr[i].l - arr[i].ok == 0)
40                         t--;
41                 }
42                 endarr = i;
43             }
44         }
45         if (t <= 1) break;
46     }
47     for (int i = 0; i < n; i++)
48         if (arr[i].l - arr[i].ok>0) {
49             if (shu>1 && endarr == i) shu++;
50             Tow(arr[i]);
51         }
52     for (int i = 0; i < n; i++) {
53         printf("#%d\n", i + 1);
54         for (int j = 0; j < arr[i].l; j++)
55         {
56             printf("%d", arr[i].s[j][0]);
57             for (int k = 1; k < 10; k++)
58                 printf(" %d", arr[i].s[j][k]);
59             printf("\n");
60         }
61     }
62     return 0;
63 }