#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <queue>

using namespace std;

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

const int NMAX = 50001;
vector < int > G[NMAX];
bool viz[NMAX];
int dg[NMAX]; /// dg[i] = gradul interior al lui i
queue < int > q;
int n, m;

void read(){
    fin >> n >> m;
    for(int i = 0; i < m; i++){
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
        dg[y]++;
    }
}

void bfs(){
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        fout << nod << " ";
        for(auto nbr: G[nod]){
            if(!viz[nbr]){
                dg[nbr]--;
                if(dg[nbr] == 0){
                    q.push(nbr);
                    viz[nbr] = 1;
                }
            }

        }
    }
}

int main()
{
    read();
    for(int i = 1; i <= n; i++){
        if(dg[i] == 0){
            q.push(i);
            viz[i] = 1;
        }
    }
    bfs();
    return 0;
}