#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int MAX_NODES = 50000;

vector<int> graph[MAX_NODES + 1];

void topologicalSort(int &nodesLen, int nodes[MAX_NODES + 1], int startNode) {
    for (vector<int>::iterator it = graph[startNode].begin(); it < graph[startNode].end(); ++it) {
        if (graph[*it].size() > 0) {
            nodes[++nodesLen] = *it;
            topologicalSort(nodesLen, nodes, *it);
        }
    }
}

int main() {
    int noNodes, noEdges;
    fin >> noNodes >> noEdges;
    for (int i = 1; i <= noEdges; ++i) {
        int start, end;
        fin >> start >> end;
        graph[start].push_back(end);
    }
    int sortedNodes[MAX_NODES + 1], sortedNodesLen = 0;
    for (int i = 1; i <= noNodes; ++i) {
        int nodesLen = 0, nodes[MAX_NODES + 1];
        nodes[++nodesLen] = i;
        topologicalSort(nodesLen, nodes, i);
        if (nodesLen > sortedNodesLen) {
            sortedNodesLen = nodesLen;
            for (int j = 1; j <= nodesLen; ++j) {
                sortedNodes[j] = nodes[j];
            }
        }
    }
    for (int i = 1; i <= noNodes; ++i) {
        if (graph[i].size() == 0) {
            sortedNodes[++sortedNodesLen] = i;
        }
    }
    for (int i = 1; i <= sortedNodesLen; ++i) {
        fout << sortedNodes[i] << ' ';
    }
    return 0;
}
/*
 9 8
 1 2
 1 3
 3 4
 3 5
 5 9
 4 6
 4 7
 4 8
 =>
 1 2 3 4 5 6 7 8 9
 
 4 3
 1 2
 3 2
 4 1
 =>
 4 3 1 2
 */