#include <bits/stdc++.h>

using namespace std;

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

int n, m;
vector<int> v[50505];
int deg[50505];
queue<int> coada;

int main()
{
    fin >> n >> m;
    while(m--)
    {
        int a, b;
        fin >> a >> b;
        v[a].push_back(b);
        /// a apare inaintea lui b
        /// b are cel putin deg[b] noduri in stanga lui;
        deg[b]++;
    }
    for(int i = 1; i <= n; i ++)
    {
        if(!deg[i])
        {
            coada.push(i);
        }
    }
    while(!coada.empty())
    {
        int element = coada.front();
        fout << element << ' ';
        coada.pop();
        for(auto it : v[element])
        {
            deg[it]--;
            if(!deg[it])
            {
                coada.push(it);
            }
        }
    }
    fout << '\n';
    return 0;
}