#include <bits/stdc++.h>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector <int> L[50005];

int n, m, sir[50005], k;
bool viz[50005];

void Citire()
{
    int x, y;
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
}

void DFS(int nod)
{
    viz[nod] = 1;
    for(auto i : L[nod])
        if(!viz[i])
            DFS(i);
    sir[++k] = nod;
}

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

    for(int i = n; i >= 1; i--)
        fout << sir[i] << " ";
}
int main()
{
    Citire();
    Rez();
    return 0;
}