#include <vector>
#include <fstream>
#include <deque>
#define nmax 50100
using namespace std;
int n,m;
bool parc[nmax],parinte[nmax];
deque <int> rez;
vector <int>vect[nmax];
void dfs(int x)
{
    parc[x]=1;
    for(int i:vect[x])
    {
        if(!parc[i])
            dfs(i);
    }
    rez.push_front(x);
}
int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        f>>x>>y;
        vect[x].push_back(y);
        parinte[y]=1;
    }
    for(int i=1;i<=n;i++)
        if(!parinte[i])
            dfs(i);
    while(!rez.empty())
    {
        g<<rez.front()<<" ";
        rez.pop_front();
    }
    f.close();
    g.close();
    return 0;
}