#include <fstream>
#include <vector>
#include <queue>
#define pb push_back
#define NMAX 50005
using namespace std;

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

vector<int>G[NMAX];
int deg[NMAX];
queue<int> q;
vector<int> sol;
int n, m;

void read_data(int& n, int& m){
    f >> n >> m;
    for(int i = 1; i<=m; i++){
        int x, y;
        f >> x >> y;
        G[x].pb(y);
        deg[y]++;
    }
}

void top_sort(int n, vector<int> G[]){
    for(int i = 1; i<=n; i++){
        if(deg[i] == 0){
            q.push(i);
        }
    }
    while(!q.empty()){
        int node = q.front();
        q.pop();
        for(int i = 0; i<G[node].size(); i++){
            deg[G[node][i]] --;
            if(deg[G[node][i]] == 0){
                q.push(G[node][i]);
            }
        }
        sol.pb(node);
    }
}

void write_sol(vector<int> sol){
    for(int i = 0; i<sol.size(); i++){
        g << sol[i] << ' ';
    }
}

int main(){
    read_data(n, m);
    top_sort(n, G);
    write_sol(sol);
    return 0;
}