#include <iostream>
#include <fstream>
#define Nmax 100001
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> G[Nmax];
int viz[Nmax];
int k,sol[Nmax];
void DFS(int nod)
{

    viz[nod]=1;
    for(unsigned int i=0;i<G[nod].size();i++)
        if(!viz[G[nod][i]])
            DFS(G[nod][i]);

    sol[++k]=nod;
}

int main()
{
    int n,m;
    fin>>n>>m;
    int i,x,y;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);

    }

    for(i=1;i<=n;i++)
       if(!viz[i])
            DFS(i);


    for(i=n;i>=1;i--)
        fout<<sol[i]<<" ";

    return 0;
}