#include <iostream>
#include <vector>
#include <fstream>
#include <queue>

const int MAXN = 50000 + 1;

using namespace std;

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

vector<int>graf[MAXN];
queue<int>coada;
int n,m,grad[MAXN];

void bfs(){
    for(int i = 1; i <= n; i++)
        if(grad[i] == 0)
            coada.push(i);
    vector<int>sortare_topologica;
    while(coada.size()){
        int nod = coada.front();
        sortare_topologica.emplace_back(nod);
        coada.pop();
        for(auto vecin : graf[nod]){
            grad[vecin]--;
            if(!grad[vecin])
                coada.push(vecin);
        }
    }
    for(auto nod : sortare_topologica)
        out<<nod<<" ";
}
vector<int>ans;
bool viz[MAXN];
void dfs(int nod){
    viz[nod] = true;
    for(auto vecin : graf[nod])
        if(!viz[vecin])
            dfs(vecin);
    ans.emplace_back(nod);
}

int main()
{
    in>>n>>m;
    for(int i = 1; i <= m; i++){
        int x,y;
        in>>x>>y;
        graf[x].push_back(y);
        grad[y]++;
    }
//    bfs();
    for(int i = 1; i <= n; i++)
        if(!viz[i])
            dfs(i);
    for(auto nod : ans)
        out<<nod<<" ";
    return 0;
}