#include <cstdio>
#include <vector>
#include <algorithm>
#include <bitset>

using namespace std;

const int NMAX = 50000;

int topo[NMAX + 5];
vector<int> G[NMAX + 5];
bitset<NMAX + 5> viz;

void DFS(int u, int& cnt)
{
  viz[u] = true;
  for(int j = 0;j < G[u].size();++j)
    if(viz[G[u].at(j)] == false)
      DFS(G[u].at(j), cnt);
  topo[++cnt] = u;
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    int n, m, u, v, cnt;
    scanf("%d%d", &n, &m);
    for(int i = 1;i <= m;++i)
    {
      scanf("%d%d", &u, &v);
      G[u].push_back(v);
      G[v].push_back(u);
    }
    cnt = 0;
    DFS(1, cnt);
    for(int i = 1;i <= n && cnt != n;++i)
      if(viz[i] == false)
        DFS(i, cnt);
    for(int i = cnt; i >= 1;--i)
      printf("%d ", topo[i]);
    printf("\n");
    return 0;
}