#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

#define NMAX 50005

int n, m, x, y, cntNoduri = 0;
bool viz[NMAX] = {false};
vector<int> G[NMAX];
vector<int> ord;

void citire() {
    fin>>n>>m;
    for(int i = 1; i<=m; i++) {
        fin>>x>>y;
        G[x].push_back(y);
    }
}

void sortTop(int nod) {
    viz[nod] = true;

    for(int vecin : G[nod]) {
        if(!viz[vecin]) {
            sortTop(vecin);
        }
    }

    ord.push_back(nod);
}

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

    for(int i = ord.size()-1; i>=0; i--) {
        fout<<ord[i]<<" ";
    }
}

int main() {
    citire();
    solve();

    return 0;
}