#define fisier "sortaret"
#include <fstream>
std::ifstream in(fisier ".in");
std::ofstream out(fisier ".out");
const int N = 50000;
#include <vector>
std::vector<int> L[N];
int R[N], l;
#include <bitset>
std::bitset<N> E;
int dfs(int t)
{
    E[t] = true;
    for (int f: L[t])
        if (not E[f])
            dfs(f);
    R[l++] = t;
}
int main()
{
    int n, m;
    in >> n >> m;
    while (m--)
    {
        int a, b;
        in >> a >> b;
        L[--a].push_back(--b);
    }
    for (int i = 0; i < n; i++)
        if (not E[i])
            dfs(i);
    for (int i = n - 1; i >= 0; i--)
        out << R[i] + 1 << ' ';
}