#include <iostream>
#include <vector>
#include <fstream>
#include <deque>
#define nmax 500005
using namespace std;
int n,m,k;
bool parc[nmax];
deque <int> rez;
vector <char>vect[nmax];
ifstream f("sortaret.in");
ofstream g("sortaret.out");
void dfs(int x)
{
    if(!parc[x])
    {
        parc[x]=1;
        rez.push_front(x);
        for(int i:vect[x])
            dfs(i);
    }
}
int main()
{
    f>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        f>>x>>y;
        vect[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!parc[i])
            dfs(i);
    int r=rez.size();
    while(r>0)
    {
        g<<rez.back()<<" ";
        rez.pop_back();
        r--;
    }
    return 0;
}