#include <bits/stdc++.h>

using namespace std;

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

int n,m;
vector<int> lista[50005];
int gr[50005]; //gradul fiecarui nod

int main()
{
    fin>>n>>m;
    int x,y;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        lista[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    {
        for(auto x:lista[i])
            gr[x]++;
    }
    queue<int> q;
    for(int i=1;i<=n;i++)
        if(gr[i]==0)
            q.push(i);
    while(!q.empty())
    {
        int nod=q.front();
        fout<<nod<<" ";
        q.pop();
        for(auto x:lista[nod])
        {
            --gr[x];
            if(gr[x]==0)
                q.push(x);
        }
    }
    return 0;
}