#include <iostream>
#include <fstream>
#include <vector>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

const int Nmax = 50005;
int n, m, Use[Nmax], Sol[Nmax];
vector <int> G[Nmax];

void Read()
{
    f>>n>>m;
    while(m--)
    {
        int x, y;
        f>>x>>y;
        G[x].push_back(y);
    }
}

void Solve(int Nod)
{
    Use[Nod] = 1;
    for(int i = 0; i < (int)G[Nod].size(); i++)
    {
        int Vecin = G[Nod][i];
        if(!Use[Vecin]) Solve(Vecin);
    }
    Sol[++m] = Nod;
}

void Print()
{
    for(int i = m; i >= 1; i--) g<<Sol[i]<<' ';
    g<<'\n';
}

int main()
{
    Read();
    m = 0;
    for(int i = 1; i <= n; i++)
        if(!Use[i]) Solve(i);
    Print();
    return 0;
}