#include <bits/stdc++.h>
#define Nmax 50001
using namespace std;

vector <int> L[Nmax];
bitset <Nmax> viz;
int n, m;
int sol[Nmax], top;

void Citire()
{
    ifstream f("sortaret.in");
    f >> n >> m;
    int x, y;
    for(int i = 1; i <= m; i++)
    {
        f >> x >> y;
        L[x].push_back(y);
    }
    f.close();
}

void DFS(int nod)
{
    viz[nod] = 1;
    for(unsigned i = 0; i < L[nod].size(); i++)
    {
        int j = L[nod][i];
        if(viz[j] == 0)
            DFS(j);
    }
    sol[++top] = nod;
}

void Rezolv()
{
    for(int i = 1; i <= n; i++)
        if(viz[i] == 0)
            DFS(i);
}

void Afisare()
{
    ofstream g("sortaret.out");
    for(int i = n; i >= 1; i--)
        g << sol[i] << " ";
    g << "\n";
    g.close();
}

int main()
{
    Citire();
    Rezolv();
    Afisare();
    return 0;
}