using namespace std;
#include<bits/stdc++.h>

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

vector<vector<int>> G;
vector<int> deg, Q;
int n, m;

int main() {
    
    fin >> n >> m;
    
    deg.resize(n+2);
    Q.resize(n+2);
    G.resize(n+2);
    
    for (int i = 1; i<=m; i++) {
        int x, y;
        
        fin >> x >> y;
        
        G[x].push_back(y);
        deg[y]++;
        
    }
    
    while (Q[0] < n) {
        for (int i = 1; i<=n; i++) {
            if (deg[i] == 0) {
                deg[i] = -1;
                Q[++Q[0]] = i;
                
                for (auto nxt: G[i]) {
                    deg[nxt]--;
                }
            }
        }
    }
    
    for (int i = 1; i<=n; i++) {
        fout << Q[i] << " ";
    }
    
    return 0;
}