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

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

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