#include <fstream>
#include <vector>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n,m,i,x,y,viz[50005],v[200005],nr;
vector <int> g[50005];

void dfs(int nod){
    viz[nod]=1;
    for(int i=0;i<g[nod].size();i++)
        if(viz[g[nod][i]]==0)
            dfs(g[nod][i]);
    v[++nr]=nod;
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        g[x].push_back(y);
    }
    dfs(1);
    for(i=nr;i>0;i--)
        fout<<v[i]<<' ';
    return 0;
}