#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;

int n, m;
vector<int> A[50100];

int ap[50100];
stack<int> sol;
stack<int> inv;

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

void sorteaza(int node) {
    for (vector<int>::iterator it = A[node].begin(); it != A[node].end(); ++it) {
        if (!ap[node]) {
            ap[node] = 1;
            sorteaza(*it);
        }
    }
    sol.push(node);
}

int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y;
        fin >> x >> y;
        A[x].push_back(y);
    }

    for (int i = 1; i <= n; ++i) {
        if (!ap[i]) {
            ap[i] = 1;
            sorteaza(i);
        }
    }

    while (sol.size()) {
        inv.push(sol.top());
        sol.pop();
    }

    while (inv.size()) {
        fout << inv.top() << ' ';
        inv.pop();
    }
}