#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NR 100005
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector <int>G[NR];
vector <int>::iterator it;
queue <int> varfuri;

int viz[NR],m,n,nr,grad[NR];

void citire()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
        grad[y]++;
    }

    for(int i=1; i<=n; i++)
        if(grad[i]==0)
        {
            varfuri.push(i);
            g<<i<<" ";
        }
}
void sortareBFS()
{
    while(!varfuri.empty())
    {
        int varfCurent=varfuri.front();
        varfuri.pop();
        for(it=G[varfCurent].begin(); it!=G[varfCurent].end(); it++)
        {
                if(grad[*it]-1==0)
                {
                        grad[*it]-=1;
                    varfuri.push(*it);
                    g<<*it<<" ";
                }
            }
        }
}


int main()
{
    citire();
    sortareBFS();

    return 0;
}