#include <fstream>
#include <vector>
using namespace std;
int n,i,m,x,y,postordine[50001],nr;
bool o[50001];
vector<int> G[50001];
void DFS(int s)
{
    int i,z=G[s].size();
    o[s]=1;
    for (i=0;i<z;i++)
        if (!o[G[s][i]])
            DFS(G[s][i]);
    postordine[++nr]=s;
}
int main()
{
    ifstream fin ("sortaret.in");
    ofstream fout ("sortaret.out");
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        if (!o[i]) DFS(i);
    for (i=n;i>=1;i--)
        fout<<postordine[i]<<" ";
    fin.close();
    fout.close();
    return 0;
}