#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

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

vector <int> L[50002];
vector <int> topsort;
bool viz[50002];
int n, m, first;

void Citire()
{
    int i, j;
    int x, y;
    fin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
        L[y].push_back(x);
    }
}

void DFS_pe_timpi_finali(int k)
{
    int j, nod;
    viz[k] = 1;
    for (j = 0; j < L[k].size(); j++)
    {
        nod = L[k][j];
        if (!viz[nod])
            DFS_pe_timpi_finali(nod);
    }
    topsort.push_back(k);
}

void Afisare()
{
    int i;
    for (i = topsort.size()-1; i >= 0; i--)
        fout << topsort[i] << " ";
    fout << endl;
}

int main ()
{
    int i;
    Citire();
    for (i = 1; i <= n; i++)
    if (!viz[i])
        DFS_pe_timpi_finali(i);
    Afisare();
    return 0;
}