#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

const int NMAX = 50'001;

int n, m, vis[NMAX];
vector < int > G[NMAX];
stack < int > order;

void Read() {

    f >> n >> m;

    while (m--) {
        int x, y;
        f >> x >> y;
        G[x].push_back(y);
    }
}

void dfs(int node) {

    vis[node] = 1;

    for(int neighbor : G[node])
        if(!vis[neighbor])
            dfs(neighbor);

    order.push(node);
}

void Solve() {

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

void Print() {

    while(!order.empty()) {
        g << order.top() << ' ';
        order.pop();
    }
}

int main() {

    Read();
    Solve();
    Print();

    return 0;
}