#include <fstream>
#include <algorithm>
#include <vector>
#include <iterator>
#include <queue>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
#define NMAX 50005

bool viz[NMAX];
vector<int>adjList[NMAX], ordine;
int n, m;

void citire()
{
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y;
        in >> x >> y;
        adjList[x].push_back(y);
    }
}

void dfs(int nod)
{
    viz[nod] = true;
    for (unsigned int i = 0; i < adjList[nod].size(); i++)
    {
        int v = adjList[nod][i];
        if (!viz[v])
            dfs(v);
    }
    ordine.push_back(nod);
}

int main()
{
    citire();
    for (int i = 1; i <= n; i++)
        if (!viz[i])
            dfs(i);
    reverse_copy(ordine.begin(), ordine.end(), ostream_iterator<int>(out, " "));
}