#include <bitset>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
vector <int> muchii[50001];
queue <int> q;
bitset <50001> viz;ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
void DFS(int nod){
    viz[nod] = 1;
    cout << nod << " ";
    for(auto x : muchii[nod]){
        if(!viz[x])
            DFS(x);
    }
}
int main()
{

    int n,m;
    cin >> n >> m;
    for(int i = 1;i <= m;i++){
        int x,y;
        cin >> x >> y;
        muchii[x].push_back(y);
    }
    DFS(1);
    return 0;
}