#include <iostream>
#include <stdio.h>
#include <queue>

using namespace std;

#define NMAX 100005

vector<int> graph[NMAX];
int n, m, s, viz[NMAX];
vector<int> answer;

void dfs(int node) {
    if(viz[node])
        return ;
    //printf("Incerc sa introduc nodul %d\n", node);
    viz[node] = 1;
    
    for(auto vecin : graph[node]) {
        dfs(vecin);
    }
    
    answer.push_back(node);
}

int main() {
    int a, b;

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

    scanf("%d%d", &n, &m);    
    for(int i = 1; i <= m; i++) {
        scanf("%d%d", &a, &b);
        graph[b].push_back(a);
    }
    
    for(int i = 1; i <= n; i++) {
        dfs(i);
    }
    
    for(auto elem : answer) {
        printf("%d ", elem);
    }
    printf("\n");
    
    return 0;
}