#include <iostream>
#include <queue>
#include <fstream>
#include <vector>
#define Nmax 50005

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

int n,m;

queue<int>coada;
int grad[Nmax];
vector<int>solutie;
vector<int>lista[Nmax];
bool viz[Nmax];

void citire()
{
    fin>>n>>m;

    int x,y;

    while(m--)
    {
        fin>>x>>y;

        lista[x].push_back(y);
        grad[y]++;
    }
    fin.close();
}


void DFS()
{


    while(!coada.empty())
    {
        int nod=coada.front();
            coada.pop();
         solutie.push_back(nod);

        for(int i=0;i<lista[nod].size();++i)
        {
            int vecin=lista[nod][i];

                grad[vecin]--;
                if(grad[vecin]==0)
                   coada.push(vecin);
        }
    }
}
void afisare()
{
    for(int i=0;i<solutie.size();++i)
      fout<<solutie[i]<<" ";
}
int main()
{
    citire();
    for(int i=1;i<=n;++i)
    if(grad[i]==0)coada.push(i);
    DFS();
    afisare();
    return 0;
}