#include <fstream>
#include <queue>
#include <vector>
#include <cstring>
#include <algorithm>
#include <numeric>
#define nmax 50005
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

int n, m, x, y, viz[nmax];
vector<int> liste[nmax];
vector<int> sol;

void dfs(int nod)
{
    viz[nod]=1;
    for(auto nnod : liste[nod])
    {
        if(!viz[nnod])
            dfs(nnod);
    }
    sol.push_back(nod);
}

int main()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y;
        liste[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
    {
        if(!viz[i])
            dfs(i);
    }
    reverse(sol.begin(),sol.end());
    for(auto x:sol)
        cout<<x<<' ';
    return 0;
}