#include <iostream>
#include <vector>
#include <fstream>
#include <cstring>
#include <queue>

using namespace std;

ifstream input("sortaret.in");
ofstream output("sortaret.out");

bool visited[100002] = {};
bool has_in[100002] = {};
int sorted[100002], sorted_index = 0;
vector<int> adj[100002];
queue<int> q;

void DFS(int node)
{
    visited[node] = true;
    sorted[sorted_index] = node;
    sorted_index++;
    for(int i = 0; i < adj[node].size(); i++){
        if(visited[adj[node][i]] == false){
            DFS(adj[node][i]);
        }
    }
}

int main()
{
    int N, M;
    input >> N >> M;
    for(int i = 0; i < M; i++){
        int x, y;
        input >> x >> y;
        adj[x].push_back(y);
        has_in[y] = true;

    }
    for(int i = 1; i <= N; i++){
        if(has_in[i] == false){
            DFS(i);
        }
    }
    for(int i = 0; i < N; i++){
        output << sorted[i] << " ";
    }
    return 0;
}