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

vector< vector< int > > G;
vector< int > grad;

int main() {
    ios::sync_with_stdio(false); in.tie(0); out.tie(0);

    int n, m; in >> n >> m;
    
    G.resize(n + 1); grad.resize(n + 1, 0);
    for(int i = 1; i <= m; ++i) {
        int x, y; in >> x >> y;
        G[x].push_back(y);
        grad[y]++;
    }

    queue< int > q;
    vector< int > sorted;
    for(int i = 1; i <= n; ++i) {
        if(grad[i] == 0) {
            q.push(i);
        }
    }

    vector< bool > outOfG(n + 1, false);

    while(!q.empty()) {
        int nod = q.front(); q.pop();
        outOfG[nod] = true;
        sorted.push_back(nod);

        for(auto vecin: G[nod]) {
            if(!outOfG[vecin]) {
                grad[vecin]--;
                if(grad[vecin] == 0) {
                    q.push(vecin);
                }
            }
        }
    }

    for(auto it: sorted) {
        out << it << " ";
    }

    in.close(); out.close();
     
    return 0;
}