#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int N=50000+5;
int n,m;
vector<int>v[N],sl;
bool seen[N];

inline void dfs(int nod)
{
    seen[nod]=1;
    for(auto &nou:v[nod])
        if(seen[nou]==0)
            dfs(nou);
    sl.push_back(nod);
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b; fin>>a>>b;
        v[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
        if(seen[i]==0)
            dfs(i);
    reverse(sl.begin(),sl.end());
    for(auto &x:sl) fout<<x<<" ";
    fout<<"\n";
    return 0;
}