#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,t,viz[50001];
vector<int> G[50001],f;
void dfs(int x)
{
    viz[x]=1;
    for(vector<int>::iterator it=G[x].begin();it!=G[x].end();++it)
    {
        if(viz[*it]==0)
        {
            dfs(*it);
        }
    }
    f.push_back(x);
}
int main()
{
    fin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
            dfs(i);
    }
    for(vector<int>::reverse_iterator rit=f.rbegin();rit!=f.rend();++rit)
        fout << *rit << " ";
    return 0;
}