#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int sortare_top[50001];
bool visited[50001];
int pos;
vector <int> graf[50001];
void dfs (int nod)
{

    visited[nod]=1;
    for(int i=0; i<graf[nod].size(); i++)
    {
        int y= graf[nod][i];
        if(visited[y]==0)
            dfs(y);
    }
    sortare_top[pos++]=nod;
}
int main()
{
    int n,m,x,y;
    in>>n>>m;
    for(int i=0; i<m; i++)
    {
        in>>x>>y;
        graf[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
    {
        if(visited[i]==0)
            dfs(i);
    }
    for(int i=pos-1; i>=0; i--)
    {
        out<<sortare_top[i]<<" ";
    }
    return 0;
}