#include <bits/stdc++.h>

#define NMAX 50005
#define pb push_back
#define cin fin
#define cout fout

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;
int used[NMAX];
vector<int> v[NMAX];    ///listele de adiacenta

stack<int> finishTime;

void read();
void DFS(int nod);
int main()
{
    read();

    for(int i=1; i<=n; ++i)
        if(!used[i])
            DFS(i);

    while(!finishTime.empty())
    {
        cout<<finishTime.top()<<' ';
        finishTime.pop();
    }
    return 0;
}

void DFS(int nod)
{
    used[nod]=1;
    for(auto it:v[nod])
        if(!used[it])
            DFS(it);
    finishTime.push(nod);
}
void read()
{
    cin>>n>>m;
    for(int i=0; i<m; ++i)
    {
        int x, y;
        cin>>x>>y;
        v[x].pb(y);
    }
}