#include<stdio.h>
#include<algorithm>
using namespace std;
int n,k,t,nr=-1;
int st[22],sol[(1<<20)+2][22];

void back(int x)
{
	memcpy(sol[++nr],st,sizeof(st));
	int i;
	for(i=st[st[0]]+1;i<=n;i++)
	{
		st[++st[0]]=i;
		back(x+1);
		st[st[0]]=0;
		st[0]--;
	}
}

int main()
{
	freopen("submultimi.in","r",stdin);
	freopen("submultimi.out","w",stdout);
	scanf("%d%d",&n,&t);
	back(0);
	int i,j;
	for(i=1;i<=t;i++)
	{
		scanf("%d",&k);
		for(j=1;j<=sol[k][0];j++)
			printf("%d ",sol[k][j]);
		printf("\n");
	}
	return 0;
}