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

#define MAXN 50005

typedef vector<int>::iterator iter;
typedef vector<int>::reverse_iterator riter;

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

int n;
vector<int> G[MAXN];
bitset<MAXN> viz;
vector<int> order;

void topo(int nd)
{
    if (viz[nd] == true) {
        return;
    }
    viz[nd] = true;

    for (iter it = G[nd].begin(); it != G[nd].end(); it++) {
        topo(*it);
    }
    order.push_back(nd);
}

int main()
{
    int m;
    f >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;
        G[x].push_back(y);
    }

    for (int i = 1; i <= n; i++) {
        topo(i);
    }

    for (riter it = order.rbegin(); it != order.rend(); it++) {
        g << *it << ' ';
    }
    g << '\n';

    f.close();
    g.close();
    return 0;
}