#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#define lim 100005
using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

int n, m, parcurs[lim];
vector <int> v[lim];
stack <int> s;
void citire()
{
    in>>n>>m;
    int x, y;
    for(int i=1; i<=m; ++i)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
}

void topological_sort(int nr)
{
    ;
    for(int i=0; i<v[nr].size(); ++i)
    {
        topological_sort(v[nr][i]);
    }
    if(parcurs[nr]==0)
    {
        s.push(nr);
    }
    parcurs[nr]=1;
}

void parcurgere()
{
    for(int i=1; i<=n; ++i)
    {
        if(parcurs[i]==0)
        {
            topological_sort(i);
        }
    }
}

void afisare()
{
    while(!s.empty())
    {
        out<<s.top()<<" ";
        s.pop();
    }
}
int main()
{
    citire();
    parcurgere();
    afisare();
    return 0;
}