#include <iostream>
#include <fstream>
#define nmax 100005
#include <vector>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int > G[nmax],Gt[nmax],L,Sol[nmax];
int viz[nmax],c[nmax],nrcomp,n,m,x,y;
void afisare()
{
    for(int i = 0 ; i < L.size(); i++)
        fout<<L[i]<<" ";
}

void citire()
{
    fin>>n>>m;
    for(int i = 1; i <= m ; i++)
    {

        fin>>x>>y;
        G[x].push_back(y);
    }
}
void visit(int node)
{
    if(viz[node]) return;
    viz[node]=1;
    for(int i = 0 ; i < G[node].size(); i++)
        visit(G[node][i]);
    L.push_back(node);
}
void rezolvare()
{
    for(int node=1 ; node <= n ; node ++)
    visit(node);
}
int main()
{
    citire();
    rezolvare();
    afisare();

    return 0;
}