#include <bits/stdc++.h>
const int MAX_N = 50005;

using namespace std;

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

int n, m, x, y;
vector<int> vecini[MAX_N];
int fv[MAX_N];
queue<int> q, sol;
int main()
{
    int i;
    fin>>n>>m;
    for(i=1; i<=m; i++) {
        fin>>x>>y;
        vecini[x].push_back(y);
        fv[y]++;
    }
    for(i=1; i<=n; i++)
        if(fv[i]==0)
            q.push(i);
    while(!q.empty()) {
        int u=q.front();
        q.pop();
        sol.push(u);
        for(auto v : vecini[u]) {
            fv[v]--;
            if(fv[v]==0)
                q.push(v);
        }
    }
    while(!sol.empty()) {
        fout<<sol.front()<<" ";
        sol.pop();
    }
    return 0;
}