#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>

#define pii pair <int, int>
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define pb push_back
#define fr first
#define sc second
#define vt vector
#define ub upper_bound
#define lb lower_bound

using namespace std;

string filename = "sortaret";
ifstream fin(filename + ".in");
ofstream fout(filename + ".out");

const int NMAX = 50000;

vt <int> adj[NMAX + 1];
bool viz[NMAX + 1];

vt <int> topo;

void dfs(int node){
    viz[node] = 1;
    for(int vec : adj[node]){
        if(!viz[vec]){
            dfs(vec);
        }
    }
    topo.pb(node);
}

int main(){

    int n, m;
    fin >> n >> m;

    for(int i = 1; i <= m; i++){
        int a, b;
        fin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
    }

    for(int i = 1; i <= n; i++){
        if(!viz[i]){
            dfs(i);
        }
    }

    reverse(all(topo));

    for(int x : topo){
        fout << x << ' ';
    }
    fout << '\n';

    return 0;
}