#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int nmax = 5e4+5;
void dfs(int nod);

int n, m;
bool viz[nmax];
vector<int> adj[nmax], sortaret;

int main()
{
    fin>>n>>m;
    for(int i = 1; i <= m; ++i)
    {
         int x, y;
         fin>>x>>y;
         adj[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i)
    {
        if(!viz[i])
            dfs(i);
    }
    reverse(sortaret.begin(), sortaret.end());
    for(auto i : sortaret)
        fout<<i<<" ";

    return 0;
}

void dfs(int nod)
{
    viz[nod] = true;
    for(auto i : adj[nod])
    {
        if(!viz[i])
            dfs(i);
    }
    sortaret.push_back(nod);
}