#include <bits/stdc++.h>
using namespace std;

int N, M;
const int NMAX = 100005;
vector<int> Muchii [NMAX];
vector <int> Solutie;
vector <int> Vizita(NMAX);


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

void dfs(int nod)
{
    Vizita[nod]=1;
    for(int i=0; i<Muchii[nod].size();i++)
        if(Vizita[Muchii[nod][i]]==0)
            dfs(Muchii[nod][i]);
    Solutie.push_back(nod);
}

int main()
{
     fin>>N>>M;
    for (int i=1;i<=M;i++)
    {
        int x,y;
        fin >> x >> y;
        Muchii[x].push_back(y);
    }


    for(int i=1;i<=N;i++)
        if(Vizita[i]==0)
            dfs(i);
    for (int i=Solutie.size()-1;i>=0;i--)
        fout<<Solutie[i]<<" ";
    return 0;
}