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

vector <int> v[50001];
vector <int> rez[50001];
int grd[50001];

int main() {
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
        rez[y].push_back(x);
    }
    for(int i = 1; i <= n; i++) {
        grd[i] = rez[i].size();
    }
    queue <int> q;
    for(int i = 1; i <= n; i++) {
        if(grd[i] == 0) {
            q.push(i);
        }
    }
    while(!q.empty()) {
        int nod = q.front();
        q.pop();
        fout << nod << " ";
        for (auto it: v[nod]) {
            grd[it]--;
            if(grd[it] == 0) {
                q.push(it);
            }
        }
    }
}