#include <fstream>
#include <vector>

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

const int NMax = 50005;
vector <int> v[NMax];
int n, m;
bool use[NMax];
int Sol[NMax], k;

void Read()
{
    f>>n>>m;
    for(int i = 1; i <= m; i++)
    {
        int x,y;
        f>>x>>y;
        v[x].push_back(y);
    }
}

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

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

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