#include <fstream>
#include <vector>

using namespace std;

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

int n, m;
vector<int> vecini[50005];
bool root[50005];
bool visited[50005];
vector<int> sol;

void visit(int nod){
    if(visited[nod]) return;
    for(int i = 0; i < vecini[nod].size(); i++){
        visit(vecini[nod][i]);
    }
    sol.push_back(nod);
    visited[nod] = true;
}

void topological_sort(){
    for(int i = 1; i <= n; i++){
        if(root[i]){
            visit(i);
        }
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        root[i] = true;
    }
    for(int i = 1; i <= m; i++){
        int x, y;
        root[y] = false;
        fin >> x >> y;
        vecini[x].push_back(y);
    }
    topological_sort();
    for(int i = sol.size() - 1; i >= 0; i--){
        fout << sol[i] << " ";
    }
}