#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

vector <long int> g[50010];
int viz[50010];
long int v[50010];
long int nr;
long int n,m;

void cit()
{
    fi>>n>>m;

    for(long int i=1;i<=m;i++)
    {
        long int x,y;
        fi>>x>>y;
        g[x].push_back(y);
    }

}

void dfs(long int nod)
{
    viz[nod]=1;

    for(long int i=0;i<g[nod].size();i++)
        if(!viz[ g[nod][i] ])
            dfs(g[nod][i]);

    v[++nr]=nod;
}

int main()
{
    cit();

    for(long int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);

    for(long int i=nr;i>=1;i--)
        fo<<v[i]<<" ";

    return 0;
}