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

using namespace std;

vector<int> L[1000000];
int grad[1000000];

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

int main(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i <= m;i++){
        int x,y;
        cin>>x>>y;
        grad[y]++;
        L[x].push_back(y);
    }
    queue<int> q;
    for(int i=1;i<n; i++){
        if(grad[i] == 0){
            q.push(i);
        }
    }
    while(!q.empty()){
        int x=q.front();
        q.pop();
        cout<<x<<' ';
        for(auto vec: L[x]){
            grad[vec]--;
            if(grad[vec] == 0){
                q.push(vec);
            }
        }
    }
}