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

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

vector<int> G[NMAX];
vector<int> sol;
int deg[NMAX];
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(){
    queue<int>q;
    for(int i = 1; i<=n; i++){
        if(deg[i] == 0){
            q.push(i);
        }
    }
    while(!q.empty()){
        int node = q.front();
        q.pop();
        for(const auto& adj: G[node]){
            if(--deg[adj] == 0){
                q.push(adj);
            }
        }
        sol.push_back(node);
    }
}

int main(){
    read_data(n, m);
    top_sort();
    for(const auto& rez: sol){
        g << rez << ' ';
    }

    return 0;
}