#include<cstdio>
#include<algorithm>

using namespace std;

int a[1001][1001],i,m,x,y,n,kappa,k_sol,as,ev,ok,v[1001];

int main()
{       freopen("dusman.in","r",stdin);
        freopen("dusman.out","w",stdout);
        scanf("%d%d%d",&n,&kappa,&m);
        for(i=1;i<=m;i++)
        {       scanf("%d%d",&x,&y);
                a[x][y]=a[y][x]=1;
        }
        for(i=1;i<=n;i++) v[i]=i;
        do
        {       ok=0;
                for(i=1;i<=n-1&&!ok;i++)
                        if(a[v[i]][v[i+1]])ok=1;
                if(!ok) k_sol++;
                if(k_sol==kappa)
                {        for(i=1;i<=n;i++) printf("%d ",v[i]);
                         return 0;
                }
        }
        while(next_permutation(v+1,v+n+1)&&k_sol<kappa);
        return 0;
}