#include <iostream>
#include <queue>
#include <map>
#include<algorithm>
using namespace std;
int n,p;
int numbers[101];
int t_numbers[101];
bool visisted[101];
int* arrays[200005];
struct Nums
{int count;int numbersNo;int end;
};
int t_n;
struct cmp
{bool operator()(Nums x,Nums y){if(x.count>y.count)return true;if(x.count==y.count && numbers[x.end]>numbers[y.end])return true;return false;}
};
void  BFSearch(map <int,int>::iterator iter,map <int,int> mp)
{queue<Nums> q;int curr=0;int i =0;priority_queue<Nums,vector<Nums>,cmp> pq2;for(i=0;i<n;i++){iter = mp.find(numbers[i]);if(!visisted[ iter->second]){Nums nums;nums.count=1;nums.end=i;nums.numbersNo=i;arrays[    nums.numbersNo] =new int[1];arrays[    nums.numbersNo][0] = numbers[i];visisted[iter->second] = true;pq2.push(nums);}}while(!pq2.empty()){q.push(pq2.top());pq2.pop();}curr = i;int count =0;while(!q.empty() && count<p){memset(visisted,false,sizeof(visisted));Nums t_nums = q.front();q.pop();count++;for(int j=0;j<t_nums.count-1;j++){printf("%d ",arrays[t_nums.numbersNo][j]);}printf("%d\n",arrays[t_nums.numbersNo][t_nums.count-1]);Nums n_nums;priority_queue<Nums,vector<Nums>,cmp> pq;for(int j=t_nums.end+1;j<n;j++){iter = mp.find(numbers[j]);if(numbers[j]>=numbers[t_nums.end] && !visisted[iter->second] && curr<=200005){visisted[iter->second] = true;n_nums.count = t_nums.count+1;n_nums.end = j;n_nums.numbersNo = curr;arrays[n_nums.numbersNo] = new int[n_nums.count];int x=0;for(x=0;x<t_nums.count;x++)arrays[n_nums.numbersNo][x] = arrays[t_nums.numbersNo][x];arrays[n_nums.numbersNo][x]=numbers[j];pq.push(n_nums);curr++;}}while(!pq.empty()){q.push(pq.top());pq.pop();}delete[]  arrays[t_nums.numbersNo];}
}
void map_insert(map < int, int > *mapStudent, int o, int x)
{ mapStudent->insert(map < int, int >::value_type(o, x));
} void main()
{while(scanf("%d %d",&n,&p)!=EOF){map <int,int>::iterator iter;map <int,int> mp;memset(numbers,0,sizeof(numbers));memset(visisted,false,sizeof(visisted));int k =0;t_n=n;for(int i =0;i<n;i++){scanf("%d",&numbers[i]);iter = mp.find(numbers[i]);if(iter ==mp.end()){map_insert(&mp,numbers[i],k);k++;}}BFSearch(iter,mp);printf("\n");}
}