#include <cstdio>
#include <vector>
#include <queue>

#define nMax 50010

using namespace std;

int n;
vector <int> graf[nMax];
int grad[nMax];
queue <int> q;


void citire(){
    int m;
    scanf("%d", &n);
    scanf("%d", &m);
    while(m --){
        int x;
        int y;
        scanf("%d", &x);
        scanf("%d", &y);
        grad[y] ++;
        graf[x].push_back(y);
    }
}

void stergeMuchie(int nod, int ceMuchie){
    grad[nod] --;
    for(unsigned int i = 0; i < graf[nod].size(); ++ i){
        if(graf[nod][i] == ceMuchie){
            graf[nod].erase(graf[nod].begin() + i);
            i --;;
        }
    }
}

void rezolvare(){
    for(int i = 1; i <= n; ++ i){
        if(grad[i] == 0){
            q.push(i);
        }
    }
    while(!q.empty()){
        int nod = q.front();
        printf("%d ", nod);
        q.pop();
        for(unsigned int i = 0; i < graf[nod].size(); ++ i){
            stergeMuchie(graf[nod][i], nod);
            if(grad[graf[nod][i]] == 0){
                q.push(graf[nod][i]);
            }
        }
    }
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    citire();
    rezolvare();

    return 0;
}