#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#define Nmax 50003
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
deque<int>dq;
deque<int>::iterator it;
vector<int>v[Nmax];
int viz[Nmax],x,y,n,m;
void dfs(int nod)
{
    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
        if(!viz[v[nod][i]])dfs(v[nod][i]);
    dq.push_front(nod);
    //fout<<nod<<" ";
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    for(it=dq.begin();it!=dq.end();it++)
       fout<<*it<<" ";
    return 0;
}