#include <bits/stdc++.h>

using namespace std;

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

int n, m, x, y;
bool viz[100001];
vector<int>G[100001];
stack<int>sol;

void DFS(int nod)
{
    viz[nod]=1;
    vector<int>:: iterator it;
    for(it=G[nod].begin(); it!=G[nod].end(); ++it) if(!viz[*it]) DFS(*it);
    sol.push(nod);
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
    for(int i=1; i<=n; ++i)
    {
        if(!viz[i]) DFS(i);
    }
    while(!sol.empty())
    {
        fout<<sol.top()<<" ";
        sol.pop();
    }
    return 0;
}