#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 100001
using namespace std;

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

vector <int> G[NMAX];
int viz[NMAX];
int k=1,sortareT[NMAX];

void DFS(int nod)
{
    viz[nod]=1;
    for(int i=0; i<G[nod].size(); i++)
    {
        if(viz[G[nod][i]]==0)
            DFS(G[nod][i]);
    }
    sortareT[++k]=nod;
}

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

    for(i=1; i<=N; i++)
        if(viz[i]==0)
            DFS(i);
    for(i=k; i>=1; i--)
        g<<sortareT[i]<<" ";
    return 0;
}