#include <iostream>
#include <stdio.h>
#include <queue>
#include <fstream>
using namespace std;
//implementare seminar
ifstream f("sortaret.in");
ofstream o("sortaret.out");
vector<int> graph[100005];
int n, m, s, viz[100005],a,b;
vector<int> answer;
 //dfs modificat
void dfs(int node) {
    if(viz[node])
        return ;
    viz[node] = 1;

    for(auto vecin : graph[node]) {
        dfs(vecin);
    }
    answer.push_back(node);
}

int main() {
   f>>n>>m;
    for(int i = 1; i <= m; i++) {
       f>>a>>b;
        graph[b].push_back(a);
    }

    for(int i = 1; i <= n; i++) {
        dfs(i);
    }

    for(auto elem : answer) {
        o<<elem<<" ";
    }
    return 0;
}