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

using namespace std;

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

int n, m, grad[50005];
vector<int> vec[50005];
queue<int> q;

int main(){

    fin>>n>>m;
    for(int i=1; i<=m; i++){
        int x, y;
        fin>>x>>y;
        vec[x].push_back(y);
        grad[y]++;
    }

    for(int i=1; i<=n; i++)
        if(grad[i]==0)
            q.push(i);

    while(!q.empty()){
        int nod = q.front();
        fout<<nod<<' ';
        q.pop();


        for(int j : vec[nod]){
            grad[j] -- ;
            if(grad[j] == 0)
                q.push(j);}
        }

    return 0;
}