#include <bits/stdc++.h>
using namespace std;

int n, k, m, ans;
int v[1005];
bool f[1005][1005], used[1005];
inline bool back(int step, int w){
    if(step == n){
        ++ans;
        if(ans == k){
            for(int i = 1; i <= n ; ++i)
                printf("%d ", v[i]);
            return 1;
        }
        return 0;
    }

    for(int i = 1; i <= n ; ++i){
        if(used[i] || f[w][i]) continue ;
        used[i] = 1;
        v[step + 1] = i;
        bool ok = back(step + 1, i);
        if(ok) return 1;
        used[i] = 0;
    }
    return 0;
}
int main()
{
    freopen("dusman.in", "r", stdin);
    freopen("dusman.out", "w", stdout);

    scanf("%d%d%d", &n, &k, &m);
    int x, y;
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d", &x, &y);
        f[x][y] = f[y][x] = 1;
    }

    back(0, 0);

    return 0;
}