#include <bits/stdc++.h>

using namespace std;

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

int n,m;
const int nmax=50003;
vector<int> vecini[nmax];
int grad[nmax];
int raspuns[nmax],ind;
queue<int> q;

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int a,b;
        fin>>a>>b;
        vecini[a].push_back(b);
        grad[b]++;
    }
    for(int i=1; i<=n; i++)
    {
        if(grad[i]==0) q.push(i);
    }
    while(!q.empty())
    {
        int i=q.front();
        raspuns[ind++]=i;
        q.pop();
        for(auto pi: vecini[i])
        {
            grad[pi]--;
            if(grad[pi]==0) q.push(pi);
        }
    }
    for(int i=0; i<n; i++) fout<<raspuns[i]<<" ";
    return 0;
}