#include<iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");
int n,m;
vector<int>adiacenta[50001];
stack<int>rasp;
bool viz[50001];
void DFS(int nod)
{
    for(auto v:adiacenta[nod])
    {
        if(!viz[v])
        {
            viz[v] = 1;
            DFS(v);
        }
    }
    rasp.push(nod);
}
int main()
{
    f >> n >> m;
    for(int i = 1;i<=m;i++)
    {
        int x,y;
        f >> x >> y;
        adiacenta[x].push_back(y);
    }
    for(int i = 1;i<=n;i++)
    {
        if(!viz[i])
        {
            viz[i] = 1;
            DFS(i);
        }
    }
    while(!rasp.empty())
    {
        g << rasp.top()<< " ";
        rasp.pop();
    }

}