#include <iostream>
#include <fstream>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <vector>
#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;
deque <int> coada;

void dfs(int nod){

    for(size_t i = 0; i < graf[nod].size(); ++i){
        if(fr[graf[nod][i]] == false){
            fr[graf[nod][i]] = true;
            dfs(graf[nod][i]);
        }
    }

    coada.push_front(nod);
}

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){
            //cout << graf[i].size() << " " << i  << "\n";
            if(graf[i].empty() == true)
                cout << i << " ";
            else
                varf = i;
        }


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

    fr[varf] = true;
    dfs(varf);

    while(coada.empty() == false){
        fout << coada.front() << " ";
        coada.pop_front();
    }

    return 0;
}