#include <iostream>
#include <fstream>
#include <vector>
#define M_MAX 100001
#define N_MAX 50001

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

vector <int> v[M_MAX];
int N, M, grad[N_MAX];
bool visited[N_MAX];

void DFS(int node)
{
    //cout << node;
    visited[node] = true;
    if(!grad[node])
    {
       out << node << " ";
       for(int i = 0; i < v[node].size(); i++)
           DFS(v[node][i]);
    }
    else{ grad[node]--; DFS(node);}
}

int main()
{
    in >> N >> M;
    for(int i = 0, a, b; i < M; i++)
    {
        in >> a >> b;
        v[a].push_back(b);
        grad[b]++;
    }
    for(int i = 1; i <= N; i++)
        if(grad[i] == 0 && !visited[i])
            DFS(i);
    return 0;
}