#include <fstream>
#include <vector>
#include <algorithm>
#include <list>
#include <vector>
std::ifstream in("sortaret.in");
std::ofstream out("sortaret.out");
//dfs

bool visited[50003]{0};
std::list<int> res;
std::vector<int> *Edg;

void dfs(int node)
{
    for(int i :Edg[node])
    {
        if(visited[i] == 0)
        {
            dfs(i);
            visited[i] = 1;
            res.push_front(i);
        }
    }
}
int main()
{
    int n,m;
    int x,y;
    in >> n >> m;
    Edg = new std::vector<int>[n+1];
    for(int i = 0 ; i <m ; i++)
    {
        in >> x >> y;
        Edg[x].push_back(y);
    }
    for(int i = 1 ; i <= n ; i++)
    {
        if(visited[i] == 0)
        {
            dfs(i);
            visited[i] = 1;
            res.push_front(i);
        }
    }
    for(auto it = res.begin(); it!=res.end() ; it++)
        out<<*it<<" ";
    return 0;
}