#include <bits/stdc++.h>

using namespace std;

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

vector<int> v[50001];
int n,m,x,y,tsort[50001],ind,viz[50001];

void dfs(int nod)
{
    viz[nod]=1;
    for (auto vec :v[nod])
        if (!viz[vec])
            dfs(vec);
    tsort[++ind]=nod;
}

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