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

using namespace std;

int main() {
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    
    int N, M;
    fin >> N >> M;
    
    vector<vector<int>> adj(N + 1);
    vector<int> indegree(N + 1, 0);
    
    for (int i = 0; i < M; ++i) {
        int X, Y;
        fin >> X >> Y;
        adj[X].push_back(Y);
        indegree[Y]++;
    }
    
    queue<int> q;
    for (int i = 1; i <= N; ++i) {
        if (indegree[i] == 0) {
            q.push(i);
        }
    }
    
    vector<int> result;
    result.reserve(N);
    
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        result.push_back(u);
        
        for (int v : adj[u]) {
            indegree[v]--;
            if (indegree[v] == 0) {
                q.push(v);
            }
        }
    }
    
    for (int i = 0; i < N; ++i) {
        if (i > 0) fout << " ";
        fout << result[i];
    }
    fout << "\n";
    
    fin.close();
    fout.close();
    
    return 0;
}