#include <iostream>
#include <fstream>
#include <vector>
#include <deque>

using namespace std;
ifstream in ("sortaret.in");
ofstream out ("sortaret.out");

vector <int> v[50001];
deque <int> afis;
int f[50001];

void dfs( int k )
{
    int l=v[k].size();
    for(int i=0; i<l; i++)
    {
        if(!f[v[k][i]])
        {
            f[v[k][i]]=1;
            dfs(v[k][i]);
            afis.push_front(v[k][i]);
        }
    }
}

int main()
{
    int n,m,x,y;
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
    {
        if(!f[i])
        {
            f[i]=1;
            dfs(i);
            afis.push_front(i);
        }
    }
    while(!afis.empty())
    {
        out<<afis.front()<<' ';
        afis.pop_front();
    }
    return 0;
}