#include <bits/stdc++.h>
#define Nmax 50001

using namespace std;

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

void Citire()
{
    ifstream f("sortaret.in");
    f >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        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++)
        if(viz[i] == 0)
            DFS(i);
    sol[top++] = nod;
}

void Rezolv()
{
    for(int i = 1; i <= n; i++)
        if(viz[i] == 0)
            DFS(i);
    ofstream g("sortaret.out");
    for(int i = 1; i < top; i++)
        g << sol[i] << " ";
    g << "\n";
    g.close();
}

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