#include <fstream>
#include <vector>
#include <list>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,x,y;
const int NMAX=5e5+5;
bool ok[NMAX];
vector <int> g[NMAX];
list <int> t;
void top_sort(int nod)
{
    ok[nod]=1;
    for(vector <int> :: iterator it=g[nod].begin();it!=g[nod].end();it++)
        if(!ok[*it])
            top_sort(*it);
    t.push_front(nod);
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        g[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!ok[i])
        top_sort(i);
    for(list <int> :: iterator it=t.begin();it!=t.end();it++)
        cout<<*it<<" ";
    return 0;
}