#include <iostream>
#include <stack>
#include <fstream>
#include <vector>
using namespace std;
int n, m;
int viz[100005];
stack <int > st;
vector <int > nodes[100005];
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
void citire()
{
    fin >> n >> m;
    for(int i = 0; i < m; i++)
    {
        int x,y;
        fin >> x >> y;
        nodes[x].push_back(y);
    }
}
void dfs(int node){
    viz[node] = true;
    for (auto &it : nodes[node]) {
        if(!viz[it]){
            dfs(it);
        }
    }
    st.push(node);
}
void solve()
{
    for (int i = 1; i <= n; ++i) {
        if(!viz[i]){
            dfs(i);
        }
    }
}
void afisare()
{
    while(!st.empty())
    {
        fout << st.top() << " ";
        st.pop();
    }
}
int main()
{
    citire();
    solve();
    afisare();
    return 0;
}