#include <fstream>
#include <stack>
#include <vector>
#define NMAX 100005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> V[NMAX];
stack <int> stiva;
int M,N,i,j,x,y,viz[NMAX],nod;
void citire()
{
    fin>>N>>M;
    for(i=1; i<=M; i++)
    {
        fin>>x>>y;
        V[x].push_back(y);
    }
}
void DFS(int nod)
{
    viz[nod]=1;
    for(unsigned int i=0; i<V[nod].size(); i++)
    {
        int vecin=V[nod][i];
        if(!viz[vecin])
            DFS(vecin);
    }
    stiva.push(nod);
}
int main()
{
    citire();
    for(int i=1; i<=N; i++)
    {
        if(!viz[i])
            DFS(i);
    }
    while(!stiva.empty())
    {
        fout<<stiva.top()<<" ";
        stiva.pop();
    }
    fin.close();
    fout.close();
    return 0;
}