#include <iostream>
#include <fstream>
#include <algorithm>
#include <utility>
#include <queue>
#include <limits.h>
using namespace std;

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

const int NLIM = 50010;
vector <int> graf[NLIM];
bool fr[NLIM];
int n, m, varf;
queue <int> coada;

void bfs(){

    coada.push(varf);

    while(coada.empty() == false){
        int nod = coada.front();
        fr[nod] = true;
        coada.pop();

        fout << nod << " ";
        for (size_t i = 0; i < graf[nod].size(); ++i){
            if(fr[graf[nod][i]] == false)
                coada.push(graf[nod][i]);
        }
    }


}
int main() {
    fin >> n >> m;

    for(int i = 1; i <= m; ++i){
        int a, b;
        fin >> a >> b;
        graf[a].push_back(b);
        fr[b] = true;
    }

    for(int i = 1; i <= n; ++i)
        if(fr[i] == false){
            varf = i;
            break;
        }

    for(int i = 0; i < NLIM; ++i)
        fr[i] = false;

    bfs();

    return 0;
}