//#include <iostream>
#include <fstream>
#include <queue>
#include <list>
using namespace std;
int n, m, x, y;
vector< list<int> > L;
vector<int> d;
queue<int> Q;
ifstream in("sortaret.in");
ofstream cout("sortaret.out");
int main(){
    in >> n >> m;
    d.resize(n+1, 0);
    L.resize(n+1);
    for(int i=1;i<=m;i++){
        in >> x >> y;
        L[x].push_back(y);
        d[y]++;

    }
    for(int i=1;i<=n;i++)
        if(d[i] == 0) {
            Q.push(i);
        }
    while(!Q.empty()){
        int K = Q.front();
        Q.pop();
        cout << K << ' ';
        for(auto &i : L[K]){
            d[i]--;
            if(d[i] == 0) Q.push(i);
        }
    }
    return 0;
}