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

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

void DFS(int x) {
    viz[x]=1;
    for (auto it:V[x]) {
        if (!viz[it]) DFS(it);
    } S.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 (S.size()) {
        cout<<S.top()<<" "; S.pop();
    }

    return 0;
}