#include <bits/stdc++.h>
using namespace std;

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

int n, m, x, y, grade[50001];
vector<vector<int>> adj(50001);

int main(){

    fin >> n >> m;
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        adj[x].push_back(y);
        grade[y]++;
    }
    
    queue<int> q;
    for(int i = 1; i <= n; i++){
        if(grade[i] == 0)
            q.push(i);
    }

    while(!q.empty()){

        int u = q.front();
        q.pop();

        for(int i = 0; i < adj[u].size(); i++){
            grade[adj[u][i]]--;
            if(grade[adj[u][i]] == 0)
                q.push(adj[u][i]);
        }

        fout << u << ' ';
    }
}