#include <stdio.h>
#include <vector>
#include <string.h>
#include <iostream>
#include <fstream>
#include <stack>
  
#define NMAX 100005
 
void dfs (int node, std::stack<int>& order, std::vector<int> neighbors[], std::vector<bool>& visited) {
    visited[node] = true;
 
    for (int i = (int) neighbors[node].size() - 1; i >= 0; i--) {
        if (!visited[neighbors[node][i]]) {
            dfs(neighbors[node][i], order, neighbors, visited);
        }
    }
    order.push(node);
}   
  
int main() {
    std::ifstream fin("sortaret.in");
    std::ofstream fout("sortaret.out");

    int n, m;
    std::vector<int> neighbors[NMAX];
    std::stack<int> order;
    std::vector<bool> visited(n + 1, false);
  
    int i, x, y;
  
    fin >> n >> m;
   
    for (i = 1; i <= m; i++) 
    {
        fin >> x >> y;
        neighbors[x].push_back(y);
    }
  
    for (i = 1; i <= n; i++) {
        if (!visited[i]) {
            dfs(i, order, neighbors, visited);
        }
    }

    while (!order.empty()) {
        fout << order.top() << ' ';
        order.pop();
    }
 
    fout << "\n";
    return 0;
}