#include <bits/stdc++.h>

#define PII pair<int,int>
using namespace std;

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

set<PII > s;

vector<int> v[50001];
deque<int> q;

bool a[50001];

void dfs(int x) {

    a[x] = 1;

    for (int i: v[x]) {
        if (!a[i])
            dfs(i);
    }

    q.emplace_front(x);
}

int main() {

    int n, m;

    in >> n >> m;

    for (int i = 1; i <= m; i++) {
        int x, y;
        in >> x >> y;
        if (s.find({x, y}) == s.end()) {
            v[x].push_back(y);
        }
    }

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

    for (auto it = q.begin(); it != q.end(); ++it)
        out << *it<< ' ' ;

    return 0;
}