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


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

int n,m,vizitat[50005];
vector <int> G[50005],v;
stack <int> stiva;

void citire(){
    in >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        int x,y;
        in >> x >> y;
        G[x].push_back(y);

    }
}

void dfs(int x){
    vizitat[x] = 1;
    for(auto val : G[x])
        if(vizitat[val] == 0)
            dfs(val);
    stiva.push(x);
}

void sortare_top(){

    for(int i = 1; i <= n; ++i)
        if(vizitat[i] == 0)
            dfs(i);
    while (stiva.size()){
        v.push_back(stiva.top());
        stiva.pop();
    }

}

void afisare(){
    for(auto val : v)
        out << val << " ";
}

int main()
{

    citire();
    sortare_top();
    afisare();


    return 0;
}