#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int NMAX = 50005;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector <int> x[NMAX];

queue <int> q;

int n;
int rez[NMAX];
bool viz[NMAX];
int k;

void DFS(int nod)
{
    rez[++k]=nod;
    for(unsigned int i=0;i<x[nod].size();i++){
        int curent=x[nod][i];
        if(!viz[curent]){
            viz[curent]=1;
            DFS(curent);
        }
    }
}


int main()
{
    int m;
    f>>n>>m;
    while(m){
        int i,j;
        f>>i>>j;
        x[i].push_back(j);
        m--;
    }
    viz[1]=1;
    DFS(1);
    for(int i=1;i<=k;i++){
        g<<rez[i]<<" ";
    }
    f.close();
    g.close();
    return 0;
}