#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#define nmax 50001
using namespace std;

ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

vector<int> v[nmax];
stack <int> s;
int n, m;
bool seen[nmax];

void dfs(int x){
    seen[x]= true;
    for(int i=0; i<v[x].size(); i++)
        if(!seen[v[x][i]])   dfs(v[x][i]);
    s.push(x);
}

int main(){
    int x, y;
    fin >> n >> m;
    for(int i=1; i<=m; i++){
        fin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i=1; i<=n; i++)
        if(!seen[i])    dfs(i);
    while(!s.empty())   fout << s.top() <<" ", s.pop();

    return 0;
}