#include <iostream>
#include <vector>
#include <fstream>
#include <stack>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int v[50001];
vector <int> L[500001];
stack <int> coada;
void dfs(int nod)
{
    v[nod] = 1;
    for (int i = 0; i < L[nod].size(); i++)
    {
        if (v[L[nod][i]] != 1)
            dfs(L[nod][i]);
    }
    coada.push(nod);
}



int main()
{
    int n, m,a,b;
    fin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        fin >> a >> b;
        L[a].push_back(b);
    }
    for (int i = 1; i <= n; i++)
        if (v[i] != 1)
            dfs(i);
    while (!coada.empty())
    {
        fout << coada.top() << " ";
        coada.pop();
    }
    return 0;
}