#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#define NMAX 50010

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> G[NMAX];
//G[i]-lista de vecini
//G[i].push_back(j) bag in vect
stack <int> S;
int viz[NMAX];
void dfs(int nod)
{
    for(int i=0; i<G[nod].size(); ++i)
    {
        if(viz[G[nod][i]]==0)
        {
            viz[G[nod][i]]=1;
            dfs(G[nod][i]);
        }
    }
    S.push(nod);
}
void verifica(int n)
{
    for(int i=1; i<=n; ++i)
    {
        if(viz[i]==0)
        {
        viz[i]=1;
        dfs(i);
        }
    }
}
int main()
{
    int m, n;
    fin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        int x, y;
        fin>>x>>y;
        G[x].push_back(y);

    }
    verifica(n);
    while(!S.empty())
    {
        fout<<S.top()<<" ";
        S.pop();
    }


}