#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
//#include <bits/stdc++.h>
#define in fin
#define out fout

using namespace std;

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

vector<int> v[50001];
int d[50001]; 

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m; in >> n >> m;
    for(int i = 0; i < m; i++){
        int l, r; in >> l >> r;
        d[r]++;
        v[l].push_back(r);
    }

    queue<int> q;
    for(int i = 1; i <= n; i++){
        if(d[i] == 0) q.push(i); // poate fi scos deja, nu depinde de nimeni
    }

    while(!q.empty()){
        int nod = q.front(); q.pop();
        out << nod << " ";
        for(int i = 0; i < v[nod].size(); i++){
            d[ v[nod][i] ]--;
            if(d[ v[nod][i] ] == 0) q.push( v[nod][i] );
        }
    }

    out << '\n';

    return 0;
}