#include <fstream>
#include <queue>
#include <vector>

std::ifstream in("sortaret.in");
std::ofstream out("sortaret.out");

int n, m;
std::vector<int> vecini[50000];
bool start[50000];
bool introdus[50000];

int main() {
    in >> n >> m;

    for (int i = 0; i < m; i++) {
        int x, y;
        in >> x >> y;
        vecini[x].push_back(y);
        start[y] = 1;
    }

    std::queue<int> q;
    for (int i = 1; i <= n; i++)
        if (!start[i]) {
            q.push(i);
            introdus[i] = true;
        }

    while (!q.empty()) {
        int nod = q.front();
        q.pop();

        out << nod << ' ';

        for (int fiu : vecini[nod])
            if (!introdus[fiu]) {
                q.push(fiu);
                introdus[fiu] = true;
            }
    }
}