#include <bits/stdc++.h>
# define MAXN 50001
using namespace std;
vector<int> graph[MAXN];
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
int v[MAXN];
queue<int> q;
int main()
{
    fin>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        fin>>x>>y;
        graph[x].push_back(y);
        v[y]++;
    }
    for(int i=1; i<=n; i++)
    {
        if(v[i]==0)q.push(i);
    }
    while(!q.empty())
    {
        int node=q.front();
        for(auto it: graph[node])
        {
            v[it]--;
            if(v[it]==0)q.push(it);
        }
        q.pop();
        fout<<node<<" ";
    }

    return 0;
}