#include <iostream>
#include <fstream>
#include<vector>
#include<stack>
using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");
int n,m,nr;
bool viz[50001];
vector<int>adiacenta[50001];
stack<int>ordine;
void DFS(int x)
{
    for(auto vecin:adiacenta[x])
    {
        if(!viz[vecin])
        {
            viz[vecin] = 1;
           DFS(vecin);

        }
    }
    ordine.push(x);
}
void sortare()
{
    for(int i = 1;i<=n;i++)
    {
        if(viz[i] == 0)
            {
                viz[i] = 1;
                DFS(i);
            }
    }
}
//in acest algoritm nu conteaza de unde incepem pentru ca tot va merge
//(deseneaza graful)
int main()
{
    f >> n >> m;
    for(int i = 1;i<=m;i++)
    {
        int x,y;
        f >> x >> y;
        adiacenta[x].push_back(y);
    }
    sortare();
    while(!ordine.empty())
    {
        g << ordine.top()<< " ";
        ordine.pop();
    }
}