#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int nmax = 50005;
int N,M,sol[nmax],viz[nmax],K;
vector <int> L[nmax];

inline void DFS(int nod)
{
    for(int i = 0; i < L[nod].size(); i++)
        if(!viz[L[nod][i]]) DFS(L[nod][i]);
    viz[nod] = true;
    sol[++K] = nod;
}

int main()
{
    int i,x,y;
    fin >> N >> M;
    for(i = 1 ; i <= M; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
    for(i = 1; i <= N;++i) if(!viz[i]) DFS(i);
    for(i = N; i >= 1;--i) fout << sol[i] << " ";
    fout << "\n";
    fout.close();
    return 0;
}