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

class Task {
public:
    void solve() {
        read_input();
        get_result();
        print_output();
    }

private:
    static constexpr int NMAX = (int)1e5 + 5;

    int n, m;

    vector<int> adj[NMAX];
    stack<int> stk;

    void read_input() {
        ifstream fin("sortaret.in");
        fin >> n >> m;
        for (int i = 1, x, y; i <= m; i++) {
            fin >> x >> y;
            adj[x].push_back(y);
        }
        fin.close();
    }

    void DFS_RECURSIVE(int node, vector<int> &p) {
 
        for (int neigh : adj[node]) {
            if (p[neigh] == -1) {
                p[neigh] = node;
                DFS_RECURSIVE(neigh, p);
            }
        }

        stk.push(node);
    }

    void get_result() {

        vector <int> p (n + 1);    
        for (int i = 1; i <= n; i++) {
            p[i] = -1;
        }
    
        for (int i = 1; i <= n; i++) {
            if (p[i] == -1) {
                p[i] = 0;
                DFS_RECURSIVE(i, p);
            }
        }
    }


    void print_output() {
        ofstream fout("sortaret.out");
        while (stk.empty() == false) {
            fout << stk.top() << ' ';
            stk.pop();
        }
        fout << '\n';
        fout.close();
    }
};

int main() {
    auto* task = new (nothrow) Task();
    if (!task) {
        cerr << "new failed: WTF are you doing? Throw your PC!\n";
        return -1;
    }
    task->solve();
    delete task;
    return 0;
}