#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>

using namespace std;

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

const int nmax = 100001;

class Graf
{
private:
    bool orientat;
    int nrNoduri;
    vector <int> listaAdiacenta[nmax];
public:
    Graf(int nrNoduri = 0, bool orientat = false);
    int get_nrNoduri();
    void citireMuchii(int nrMuchii);
    vector<int> BFS(int start);
    void DFS(int nodCurent, bool *vizitatDFS);
    int nrComponenteConexe();
    void DFSStiva(int nodcurent, bool *vizitatDFS, stack<int> &stivaTimp);
    void sortareTopologica();
};

Graf :: Graf(int nrNoduri, bool orientat) : nrNoduri(nrNoduri), orientat(orientat)
{
    this->nrNoduri = nrNoduri;
    this->orientat = orientat;
}

int Graf::get_nrNoduri()
{
    return this->nrNoduri;
}

void Graf::citireMuchii(int nrMuchii)
{
    int nod1, nod2;
    for(int i = 0; i < nrMuchii; i++)
    {
        in >> nod1 >> nod2;
        listaAdiacenta[nod1].push_back(nod2);
        if(!orientat)
        {
            listaAdiacenta[nod2].push_back(nod1);
        }
    }
}

void Graf::DFSStiva(int nodCurent, bool *vizitatDFS, stack<int> &stivaTimp)
{
    vizitatDFS[nodCurent] = true;
    for(auto vecin:listaAdiacenta[nodCurent])
    {
        if (!vizitatDFS[vecin])
        {
            DFSStiva(vecin, vizitatDFS, stivaTimp);
        }
    }
    stivaTimp.push(nodCurent);
}

void Graf::sortareTopologica()
{
    bool vizitat[nmax] = {false};
    stack <int> stivaTimp;
    for(int i = 1; i <= nrNoduri; i++)
    {
        if(!vizitat[i])
        {
            DFSStiva(i, vizitat, stivaTimp);
        }
    }
    while(!stivaTimp.empty())
    {
        out << stivaTimp.top() << " ";
        stivaTimp.pop();
    }
}


int main() {
    int n, m;
    in >> n >> m;
    Graf g(n,true);
    g.citireMuchii(m);
    g.sortareTopologica();
    return 0;
}