#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define nmax 50005
int v[nmax], nr=0, n, m;
bool viz[nmax]={0};
vector<int> g[nmax];
void citire()
{
    int i, x, y;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
    fin.close();
}
void dfs(int nod)
{
    vector<int>::iterator it;
    viz[nod]=1;
    for(it=g[nod].begin(); it!=g[nod].end(); it++)
        if(!viz[*it])
            dfs(*it);
    v[++nr]=nod;
}
void solve()
{
    int i;
    for(i=1; i<=n; i++)
        if(!viz[i])
            dfs(i);
    for(i=n; i>=1; i--)
        fout<<v[i]<<' ';
    fout<<'\n'; fout.close();
}
int main()
{
    citire();
    solve();
    return 0;
}