#include <bits/stdc++.h>
#define nmax 50002
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> L[nmax];
int n, m, viz[nmax];
int s[nmax], p;

void Citire()
{
    int i, j, k;
    fin >> n >> m;
    for (k = 1; k <= m; k++)
    {
        fin >> i >> j;
        L[i].push_back(j);
    }
}
///O(n + m)
void DFS(int k)
{
    viz[k] = 1;
    for (int i : L[k])
        if (viz[i] == 0) DFS(i);
    /// acum s-a terminat de vizitat nodul k
    /// si toti adicentii sai, deci il pun in s
    s[++p] = k;
}
///O(n + m)
void SortTop()
{
    for (int k = 1; k <= n; k++)
        if (viz[k] == 0)
            DFS(k);
    /// afisam s de la dreapta la stanga
    for (int i = n; i >= 1; i--)
        fout << s[i] << " ";
    fout << "\n";
}

int main()
{
    Citire();
    SortTop();
    fin.close();
    fout.close();
    return 0;
}