#include <fstream>
#include <vector>

using namespace std;

int n, postordine[50005], nr;
bool viz[50005];
vector <int> a[50005];

void DFS(int x)
{
    vector <int>::iterator it;
    viz[x] = 1;
    for(it = a[x].begin(); it != a[x].end(); ++it)
        if(!viz[*it]) DFS(*it);
    postordine[++nr] = x;
}

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

    for(int i = 1; i <= n; ++i)
        if(!viz[i]) DFS(i);

    ofstream fout("sortaret.out");
    for(int i = nr; i; --i) fout << postordine[i] << " ";
    fout.close();
    return 0;
}