#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50005
#define MMAX 100005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
vector<int>muchie[MMAX];
queue<int>coada;
int gin[NMAX];
bool sel[NMAX];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        muchie[x].push_back(y);
        gin[y]++;
    }
    for(int i=1;i<=n;i++)
        if(gin[i]==0){coada.push(i);fout<<i<<" ";}
    while(!coada.empty())
    {
        int i;
        i=coada.front();
        coada.pop();
        for(size_t j=0;j<muchie[i].size();j++)
        {
            gin[muchie[i][j]]--;
            if(gin[muchie[i][j]]==0){coada.push(muchie[i][j]);fout<<muchie[i][j]<<" ";}
        }
    }
    return 0;
}