#include<fstream>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#define NMAX 50001

//in-out
std::ifstream f("sortaret.in");
std::ofstream g("sortaret.out");

//data
std::queue<int> q;
std::vector<int>G[NMAX]; //graph
std::vector<int>out(NMAX);
std::vector<int>sol;
int n, m;

//read data
void readData(){
    f >> n >> m;
    int x, y;
    for(int i = 0; i<m; i++){
        f >> x >> y;
        x --; y--;
        G[x].push_back(y);
        out[x] ++;
    }
}

//solve problem
void solve(){
    for(int i = 0; i<n; i++){
        if(out[i] == 0){
            q.push(i);
        }
    }
    while(!q.empty()){
        int node = q.front();
        sol.push_back(node + 1);
        q.pop();
        for(int i = 0; i<n; i++){
            auto it = std::find(G[i].begin(), G[i].end(), node);
            if(it != G[i].end()){
                out[i] -- ;
                if(!out[i]){
                    q.push(i);
                }
            }
        }
    }
}



int main(){
    readData();
    solve();
    for(int i = n - 1; i>=0; i--){
        g << sol[i] << ' ';
    }
    return 0;
}