#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 500005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> G[NMAX];
int N,M,NR;
int beenThere[NMAX],v[NMAX];
void Read()
{
    fin>>N>>M;
    for (int i=1; i<=M; i++)
    {
        int x,y;
        G[x].push_back(y);
    }
    fin.close();
}
void DFS(int Nod)
{
    beenThere[Nod]=1;
    for (int i=0; i<G[Nod].size(); i++)
    {
        int Vecin=G[Nod][i];
        if (!beenThere[Vecin])
            DFS(Vecin);
    }
    v[++NR]=Nod;
}
int main()
{
    Read();
    for (int i=1; i<=N; i++)
        if (!beenThere[i])
            DFS(i);
    for (int i=NR; i>=1; i--)
        fout<<v[i]<<" ";
    return 0;
}