#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50100
#define pb push_back

using namespace std;

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

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

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(){
    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]);
            }
        }
        res.pb(node);
    }
}


int main(){
    read_data(n, m);
    top_sort();
    for(int i = 0; i<res.size(); i++){
        g << res[i] << ' ';
    }
}