#include <stdio.h>
#include <vector>
#include <string.h>
#include <iostream>
#include <fstream>
#include <stack>
 
#define NMAX 100005
bool visited[NMAX];
int n, m;
std::vector<int> neighbors[NMAX];
std::vector<int> order;

void dfs (int node) {
    visited[node] = true;

    for (int i = (int) neighbors[node].size() - 1; i >= 0; i--) {
        if (!visited[neighbors[node][i]]) {
            dfs(neighbors[node][i]);
        }
    }
    order.push_back(node);
}   
 
int main() {
    std::ifstream fin("sortaret.in");
    std::ofstream fout("sortaret.out");
 
    int i, x, y;
 
    fin >> n >> m;
  
    for (i = 1; i <= m; i++) 
    {
        fin >> x >> y;
        neighbors[x].push_back(y);
    }
 
    memset(visited, false, NMAX * sizeof(bool));

    for (i = 1; i <= n; i++) {
        if (!visited[i]) {
            dfs(i);
        }
    }

    for (i = (int) order.size() - 1; i >= 0; i--) {
        fout << order[i] << ' ';
    }

    fout << "\n";
    return 0;
}