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

bool viz[500005];

stack<int> traverse;
vector<int> edges[500005];

void dfs(int node){
    if(viz[node] != true){
        viz[node] = true;
        for(int i=0; i< (int) edges[node].size(); i++){
            dfs(edges[node][i]);
        }
        traverse.push(node);
    }
}

int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");

    int n, m;
    f>>n>>m;

    vector<int> parent;

    for(int i=0; i<=n; i++){
        parent.push_back(-1);
    }

    int x, y;
    for(int i=1; i<=m; i++){
        f>>x>>y;
        parent[y] = x;
        edges[x].push_back(y);
    }


    for(int i=1; i<=n; i++){
        if(parent[i] == -1){
            dfs(i);
        }
    }

    for(int i=0; i<n; i++){
        g<<traverse.top()<<" ";
        traverse.pop();
    }

    f.close();
    g.close();
    return 0;
}