#include <fstream>
#include <iostream>
#include <vector>

using namespace std;

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

const int NLIM=50005;
bool viz[NLIM];
int N,M,Sol[NLIM],k=0;

vector <int> V[NLIM];

void DFS(int node)
{
    viz[node]=1;
    for(unsigned int i=0; i<V[node].size(); i++)
    {
        int vec=V[node][i];
        if(viz[vec]==0)
            DFS(vec);
    }
    Sol[++k]=node;
}

void Read()
{
    int x,y;
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
     fin>>x>>y;
     V[x].push_back(y);
    }
    for(int i=1;i<=N;i++)
    {
        if(viz[i]==0)
            DFS(i);
    }
    for(int i=k;i>=1;i--)
        fout<<Sol[i]<<" ";
    fout<<'\n';
}

int main()
{
    Read();
    return 0;
}