#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int MAX_NODURI = 50005;
vector<int> graf[MAX_NODURI];
int grad_intern[MAX_NODURI];

vector<int> sortareTopologica(int n) {
    vector<int> solutie;
    queue<int> coada;
    
    for (int i = 1; i <= n; i++) {
        if (grad_intern[i] == 0) {
            coada.push(i);
        }
    }
    
    while (!coada.empty()) {
        int nod_curent = coada.front();
        coada.pop();
        
        solutie.push_back(nod_curent);
        
        for (int vecin : graf[nod_curent]) {
            grad_intern[vecin]--;
            if (grad_intern[vecin] == 0) {
                coada.push(vecin);
            }
        }
    }
    
    return solutie;
}

int main() {
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    
    int n, m;
    fin >> n >> m; 
    
    for (int i = 0; i < m; i++) {
        int u, v;
        fin >> u >> v;
        graf[u].push_back(v);
        grad_intern[v]++; 
    }
    
    vector<int> ordonare = sortareTopologica(n);
    
    for (int i = 0; i < ordonare.size(); i++) {
        fout << ordonare[i] << " ";
    }
    fout << "\n";
    
    fin.close();
    fout.close();
    
    return 0;
}