#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,sol[50005],nr;
vector <int> a[50005];
bool viz[50005];
void dfs(int k)
{
    viz[k] = 1;
    for(int i=0;i<a[k].size();i++)
    {
        if(!viz[a[k][i]])
                dfs(a[k][i]);
    }
    sol[++nr] = k;
}
int main()
{
fin>>n>>m;
while(m--)
{
    int b,c;
    fin>>b>>c;
   a[b].push_back(c);
}
for(int i=1;i<=n;i++)
{
    if(!viz[i])
        dfs(i);
}
for(int i=n;i>=1;i--)
    fout<<sol[i] << " ";
}