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

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

vector<int>lista[Nmax];
int n,m;
bool viz[Nmax];
int nr;
int postordine[Nmax];

void citire()
{
    int x,y;

    fin>>n>>m;

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

        lista[x].push_back(y);
    }

    fin.close();
}

void DFS(int nod)
{
    viz[nod]=true;

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

        if(!viz[vecin])
            DFS(vecin);
    }
    postordine[++nr]=nod;
}

int main()
{
    citire();

    for(int i=1;i<=n;++i)
        if(!viz[i])DFS(i);

    for(int i=n;i>=1;--i)
        fout<<postordine[i]<<" ";
    return 0;
}