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

using namespace std;

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

const int NMAX = 50001;

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

void dfs(int node) {

    beenThere[node] = 1;

    for(auto& it : G[node])
        if(!beenThere[it])
            dfs(it);

    order.push(node);
}

int main() {

    f >> n >> m;

    for(;m--;) {

        int x, y;
        f >> x >> y;

        G[x].push_back(y);
    }

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

    for(;!order.empty();order.pop())
        g << order.top() << ' ';

    return 0;
}