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

using namespace std;
const int NMAX = 50000;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int N,M;
int gr[NMAX + 1];

vector<int> G[NMAX + 1], S;
queue<int> Q;

void citire(){
    int x, y;
    f >> N >> M;
    for(int i = 1; i <= M; i++){
        f >> x >> y;
        G[x].push_back(y);
        gr[y]++;
    }
}

void sortaret(){
    for(int i = 1; i <= N; i++)
        if(gr[i] == 0) Q.push(i);
    while(!Q.empty()){
        int crt = Q.front();
        Q.pop();
        S.push_back(crt);
        for(const auto &y : G[crt]){
            gr[y]--;
            if(gr[y] == 0) Q.push(y);
        }
    }
}

void afis(){
    for(const auto &x : S){
        g << x << ' ';
    }
}

int main()
{
    citire();
    sortaret();
    afis();
    f.close();
    g.close();
    return 0;
}