#include<bits/stdc++.h>
#define N 5010

using namespace std;

stack<int>Q;
int viz[N], n, m;
vector<int>V[N];

void DFS(int x) {
    viz[x] = 1;
    for (auto it: V[x]) {
        if (!viz[it]) DFS(it);
    }
    Q.push(x);
}

int main() {
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");

    cin>>n>>m;

    for (int i=1; i<=m; i++) {
        int x,y; cin>>x>>y;
        V[x].push_back(y);
    }

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

    while (Q.size()) {
        cout<<Q.top()<<" ";
        Q.pop();
    }

    return 0;
}