#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define NMAX 50005
#define ALB 0
#define GRI 1
#define NEGRU 2
int n, m, viz[NMAX];
vector<int> G[NMAX];
queue<int> q;
void dfs(int nod)
{
    viz[nod] = GRI;
    for (auto it : G[nod]){
        if (viz[it] == ALB){
            dfs(it);
        }
    }
    viz[nod] = NEGRU;
    q.push(nod);
}
int main() {
    fin >> n >> m;
    for (int i=1;i<=m;i++){
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }

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

    while(!q.empty()){
        fout << q.front() << ' ';
        q.pop();
    }
    fout << '\n';
    return 0;
}