#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int x,y,n,m,g[50001];
vector<int> G[50001],sol;
queue<int> bfs;
int main()
{
    fin>>n>>m;
    for(;m-->0;){
        fin>>x>>y;
        G[x].push_back(y);
        g[y]++;
    }
    for(int i=1;i<=n;i++)
        if(!g[i])bfs.push(i);
    while(!bfs.empty()){
        int current=bfs.front();
        fout<<current<<' ';
        bfs.pop();
        for(int i=0;i<G[current].size();i++)
        {
            g[G[current][i]]--;
            if(!g[G[current][i]]){
                bfs.push(G[current][i]);
            }
        }
    }
    return 0;
}