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

using namespace std;

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

const int NMAX = 50005;
const int MMAX = 100005;

int n, m;
vector <int> G[NMAX];
vector <int> sol;
int dg[NMAX];
queue <int > q;
int viz[NMAX];

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

void BFS(){
    while(!q.empty()){
        int cnod = q.front();
        q.pop();

        sol.push_back(cnod);
        for(auto nbr: G[cnod]){
            if(!viz[nbr]){
                dg[nbr]--;
                if(dg[nbr] == 0){
                    viz[nbr] = 1;
                    q.push(nbr);
                }
            }
        }
    }
}

int main()
{
    read();
    for(int i = 1; i <= n; i++){
        if(dg[i] == 0){
            viz[i] = 1;
            q.push(i);
        }
    }
    BFS();
    for(auto nod: sol){
        fout << nod << " ";
    }

    return 0;
}