#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream cin("dusman.in");
ofstream cout("dusman.out");
 
int d[1005][1005], a[1005], n, poz, y, x, k,  nr=0, mx, m;
bool u[1005];
 
 
 void back (int f)
 {
 	int i;
 	if (f>n)
 	{
 		++nr;
 		if (nr==k)
 		 for (i=1; i<=n; ++i)
 		 	cout<<a[i]<<' ';
	}
	else
	{
		for (i=1; i<=n; ++i)
			if (u[i]==0 && d[a[f-1]][i]==0)
			{
				u[i]=1;
				a[f]=i;
				back(f+1);
				
				u[i]=0;
				if (nr==k) return;
			}
		
	}
 	
 	
 }
 
 
 
int main()
{
	cin>>n>>k>>m;
	while (m--)
	{
		cin>>x>>y;
		d[x][y]=d[y][x]=1;
	}
	
	back(1);
		
    return 0;
}