#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> v[50005];
int n,m,i,j,x[50005],z;
bool viz[50005];
void dfs(int nod)
{
    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
        if(viz[v[nod][i]]==0)
        dfs(v[nod][i]);
    x[++z]=nod;
}
int main()
{
    fin>>n>>m;
    for(int l=1;l<=m;l++)
    {
        fin>>i>>j;
        v[i].push_back(j);
    }
    for(i=1;i<=n;i++)
        if(viz[i]==0)
        dfs(i);
    for(i=z;i>=1;i--)
        fout<<x[i]<<' ';
    return 0;
}