#include <fstream>
#include <queue>
#include <algorithm>

#define NMAX 50007

using namespace std;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

int n, m;
vector < int > v[NMAX], Ans;
int Ap[NMAX];
queue < int > q;

void bfs(){
    while(! q.empty()){
        int Node = q.front();
        q.pop();
        Ans.push_back(Node);
        for(vector < int > :: iterator it = v[Node].begin(); it != v[Node].end(); ++it)
            if(Ap[*it] > 0){
                --Ap[*it];
                if(Ap[*it] == 0)
                    q.push(*it);
            }
    }
}

int main(){
    cin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int A, B;
        cin >> A >> B;
        v[A].push_back(B);
        ++Ap[B];
    }
    for(int i = 1; i <= n; ++i)
        if(Ap[i] == 0)
            q.push(i);
    bfs();
    for(int i = 0; i < n; ++i)
        cout << Ans[i] << " ";
    return 0;
}