#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define MAX 100001
vector<int> G[MAX];
int k,v[MAX],s[MAX],n,m,x,y;
void DFS(int nod){
    v[nod]=1;
    for (auto elem:G[nod])
        if (v[elem]==0)
            v[elem]=1, DFS(elem);
    s[++k]=nod;
}
int main()
{
    fin >> n >> m;
    for (int i=1;i<=m;i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }

    for (int i=1;i<=n;i++)
        if (v[i]==0)
            DFS(i);
    for (int i=n;i>=1;i--)
        fout << s[i] << " ";
    return 0;
}