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

using namespace std;

ifstream f("sortaret.in");
ofstream  g("sortaret.out");

const int nMax=50005;

vector <int> a[nMax*2];

int n, m;
int vizitat[nMax],solutie[nMax];
int contor;

void read()
{
    f >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        f >> x >> y;
        a[x].push_back(y);
    }
}

void dfs(int nod)
{
    vizitat[nod]=1;
    for (int i = 0; i < a[nod].size(); ++i)
    {
        int x = a[nod][i];
        if (!vizitat[x]) dfs(x);
    }
    solutie[++contor]=nod;
}

void topsort()
{
    for (int i = 1; i <= n; ++i)
        if (!vizitat[i]) dfs(i);
    for (int i = contor; i >= 1; i--)
        g << solutie[i] << " ";
}

int main()
{
    read();
    topsort();
}