#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define maxn 50010

int N, M;
int deg[maxn], viz[maxn];
vector<int> G[maxn], sol[maxn];

void DFS(int nod, int niv) {
    viz[nod] = 1;
    sol[niv].push_back(nod);
    for(vector<int>::iterator it=G[nod].begin(); it!=G[nod].end(); it++) {
         if(!viz[(*it)]) {
              DFS((*it), niv + 1);
         }
    }
}

int main() {
    FILE *f1=fopen("sortaret.in", "r"), *f2=fopen("sortaret.out", "w");
    int i, j, x, y;

    fscanf(f1, "%d %d\n", &N, &M);
    for(i=1; i<=M; i++) {
         fscanf(f1, "%d %d\n", &x, &y);
         G[x].push_back(y);
         deg[y] ++;
    }

    for(i=1; i<=N; i++) {
         if(deg[i] == 0 && !viz[i]) {
              DFS(i, 1);
         }
    }

    for(i=1; i<=N; i++) {
         for(j=0; j<sol[i].size(); j++) {
              fprintf(f2, "%d ", sol[i][j]);
         }
    } fprintf(f2, "\n");

    fclose(f1); fclose(f2);
    return 0;
}