#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("sortaret.in");
ofstream gout("sortaret.out");
#define maxN 50001
vector <int> G[maxN],sortare;
int viz[maxN];
int n,m;

void dfs(int nod)
{
    viz[nod]=1;
    for(unsigned int i=0;i<G[nod].size();++i)
        if(viz[G[nod][i]]==0)
            dfs(G[nod][i]);
    sortare.push_back(nod);
}
int main()
{


    int x,y;
    fin>>n>>m;

    for(int i=0;i<m;++i)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
    for(int i=0;i<n;i++)
        if(viz[i+1]==0)
            dfs(i+1);
    for(int i=sortare.size()-1;i>=0;--i)
        gout<<sortare[i]<<" ";
    return 0;
}