#include <bits/stdc++.h>
#define MAX 131072

using namespace std;
const int NMAX = 50010;

FILE *IN;

int N, M, P;
bool seen[NMAX];
int ans[NMAX];
vector <int> Gph[NMAX];

int pos, sign;
char f[MAX];

inline void Read(int &nr){
    sign = 0;
    nr = 0;
    while(f[pos] < '0' || f[pos] > '9'){
        if(f[pos] == '-') sign = 1;
        pos++;
        if(pos == MAX)
            fread(f, MAX, 1, IN), pos = 0;
    }
    while(f[pos] >= '0' && f[pos] <= '9'){
        nr = 10 * nr + f[pos++] - '0';
        if(pos == MAX)
            fread(f, MAX, 1, IN), pos = 0;
    }
    if(sign) nr =- nr;
}

void read(){
    int x, y;
    Read(N); Read(M);
    for(int i = 1; i <= M; i++){
        Read(x); Read(y);
        Gph[x].push_back(y);
    }
}

void DFS(int node){
    ans[++P] = node;
    seen[node] = true;
    for(int i = 0; i < Gph[node].size(); i++)
        if(!seen[Gph[node][i]]) DFS(Gph[node][i]);
}

int main(){

    IN = fopen("sortaret.in", "r");
    freopen("sortaret.out", "w", stdout);

    read();

    for(int i = 1; i <= N; i++){
        if(!seen[i])
            DFS(i);
    }

    for(int i = 1; i <= P; i++)
        printf("%d ", ans[i]);

    return 0;
}