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

/**

*/
vector<int> h[50001];
int viz[50001], n, m;
int st[50001], top;

void DFS(int k)
{
    viz[k] = 1;
    for (int i : h[k])
        if (viz[i] == 0)
            DFS(i);
    st[++top] = k;
}

/// O(n + m)
void SortTop()
{
    for (int i = 1; i <= n; i++)
        if (viz[i] == 0) DFS(i);
}

void Citire()
{
    int x, y;
    ifstream fin("sortaret.in");
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        h[x].push_back(y);
    }
    fin.close();
}

void Afis()
{
    ofstream fout("sortaret.out");
    for (int i = n; i >= 1; i--)
        fout << st[i] << " ";
    fout << "\n";
    fout.close();
}

int main()
{
    Citire();
    SortTop();
    Afis();
    return 0;
}