#include <bits/stdc++.h>

using namespace std;

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

int n, m;
vector<int> v[50005];
queue<int> coada;
int grad[50005];

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i ++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
        grad[y]++;
    }
    for(int i = 1; i <= n; i ++)
    {
        if(!grad[i])
        {
            coada.push(i);
        }
    }
    while(!coada.empty())
    {
        int nod = coada.front();
        fout << nod << ' ';
        coada.pop();
        for(auto it : v[nod])
        {
            grad[it]--;
            if(!grad[it])
            {
                coada.push(it);
            }
        }
    }
    return 0;
}