#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, grad[50005];
vector<int> vec[50005];
queue<int> q;
void adaugare()
{
    int nod=q.front();
    q.pop();
    g<<nod<<' ';
    for(auto &aux:vec[nod])
    {
        grad[aux]--;
        if (!grad[aux])
            q.push(aux);
    }
}

int main()
{
    f>>n>>m;
    int x, y;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y;
        if(find(vec[x].begin(),vec[x].end(),y)==vec[x].end())
        {
            grad[y]++;
            vec[x].push_back(y);
        }
    }
    for(int i=1; i<=n; i++)
        if(!grad[i])
            q.push(i);
    while(!q.empty())
        adaugare();
    return 0;
}