#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],s;
vector <int> G[Nmax];

void DFS(int nod)
{
    use[nod] = 1;
    for(int i = 0; i < (int)G[nod].size(); i++)
    {
        int vecin = G[nod][i];
        if(use[vecin] == 0) DFS(vecin);
    }
    sol[++s] = nod;
}

int main()
{
    f>>n>>m;
    while(m--)
    {
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
    {
        if(use[i] == 0)     DFS(i);
    }
    for(int i = s; i > 0; i--) g<<sol[i]<<' ';
    g<<'\n';
    return 0;
}